Sciweavers

207 search results - page 11 / 42
» Run-Time Switching Between Total Order Algorithms
Sort
View
IPPS
2008
IEEE
14 years 1 months ago
SWAMP: Smith-Waterman using associative massive parallelism
One of the most commonly used tools by computational biologists is some form of sequence alignment. Heuristic alignment algorithms developed for speed and their multiple results s...
Shannon Steinfadt, Johnnie W. Baker
WDAG
2007
Springer
86views Algorithms» more  WDAG 2007»
14 years 1 months ago
Cost-Aware Caching Algorithms for Distributed Storage Servers
We study replacement algorithms for non-uniform access caches that are used in distributed storage systems. Considering access latencies as major costs of data management in such a...
Shuang Liang, Ke Chen, Song Jiang, Xiaodong Zhang
INFOCOM
1995
IEEE
13 years 11 months ago
Degree-Constrained Multicasting in Point-to-Point Networks
Establishing a multicast tree in a point-to-point network of switch nodes, such as a wide-area ATM network, is often modeled as the NP-complete Steiner problem in networks. In thi...
Fred Bauer, Anujan Varma
SIGMOD
2004
ACM
182views Database» more  SIGMOD 2004»
14 years 7 months ago
Efficient set joins on similarity predicates
In this paper we present an efficient, scalable and general algorithm for performing set joins on predicates involving various similarity measures like intersect size, Jaccard-coe...
Sunita Sarawagi, Alok Kirpal
CONEXT
2006
ACM
14 years 1 months ago
Detail characterization of paths in pocket switched networks
Pocket Switched Networking (PSN) is a new communication paradigm between mobile devices. It takes advantage of every local communication opportunity, and the physical mobility of ...
Abderrahmen Mtibaa, Augustin Chaintreau, Christoph...