Sciweavers

6437 search results - page 625 / 1288
» Parallel Algorithms for Arrangements
Sort
View
IPPS
2003
IEEE
16 years 21 days ago
Using Hybrid Alignment for Iterative Sequence Database Searches
Progressive sequence model refinement by means of iterative searches is an effective technique for high sensitivity database searches and is currently employed in popular tools s...
Yuheng Li, Mario Lauria, Ralf Bundschuh
CONCUR
2000
Springer
15 years 11 months ago
An Implicitly-Typed Deadlock-Free Process Calculus
Abstract. We extend Kobayashi and Sumii’s type system for the deadlock-free π-calculus and develop a type reconstruction algorithm. Kobayashi and Sumii’s type system helps hig...
Naoki Kobayashi, Shin Saito, Eijiro Sumii
PODC
1999
ACM
15 years 11 months ago
Analysis of Timing-Based Mutual Exclusion with Random Times
Various timing-based mutualexclusion algorithms have been proposed that guarantee mutual exclusion if certain timing assumptions hold. In this paper, we examine how these algorith...
Eli Gafni, Michael Mitzenmacher
165
Voted
IPPS
1999
IEEE
15 years 11 months ago
Linear Aggressive Prefetching: A Way to Increase the Performance of Cooperative Caches
Cooperative caches offer huge amounts of caching memory that is not always used as well as it could be. We might find blocks in the cache that have not been requested for many hou...
Toni Cortes, Jesús Labarta
207
Voted
IPPS
1998
IEEE
15 years 11 months ago
Processor Lower Bound Formulas for Array Computations and Parametric Diophantine Systems
Using a directed acyclic graph (dag) model of algorithms, we solve a problem related to precedenceconstrained multiprocessor schedules for array computations: Given a sequence of ...
Peter R. Cappello, Ömer Egecioglu