Sciweavers

72 search results - page 11 / 15
» External Memory Algorithms for String Problems
Sort
View
69
Voted
SPAA
2003
ACM
15 years 2 months ago
Asynchronous parallel disk sorting
We develop an algorithm for parallel disk sorting, whose I/O cost approaches the lower bound and that guarantees almost perfect overlap between I/O and computation. Previous algor...
Roman Dementiev, Peter Sanders
GLOBECOM
2007
IEEE
15 years 3 months ago
Performing Packet Content Inspection by Longest Prefix Matching Technology
—This article presents a novel mechanism to perform packet content inspection by longest prefix matching (LPM) technology. It is done by transforming the automaton-based state ta...
Nen-Fu Huang, Yen-Ming Chu, Yen-Min Wu, Chia-Wen H...
BIRTHDAY
2010
Springer
14 years 10 months ago
Choiceless Computation and Symmetry
Many natural problems in computer science concern structures like graphs where elements are not inherently ordered. In contrast, Turing machines and other common models of computa...
Benjamin Rossman
SIGMOD
2007
ACM
169views Database» more  SIGMOD 2007»
15 years 9 months ago
Genome-scale disk-based suffix tree indexing
With the exponential growth of biological sequence databases, it has become critical to develop effective techniques for storing, querying, and analyzing these massive data. Suffi...
Benjarath Phoophakdee, Mohammed J. Zaki
86
Voted
PDP
2008
IEEE
15 years 3 months ago
Out-of-Core Wavefront Computations with Reduced Synchronization
Matrix computation algorithms often exhibit dependencies between neighboring elements inside loop nests such that the frontier between computed elements and those to be computed w...
Pierre-Nicolas Clauss, Jens Gustedt, Fréd&e...