Sciweavers

270 search results - page 48 / 54
» A Phase Change Memory as a Secure Main Memory
Sort
View
STACS
1992
Springer
13 years 11 months ago
Speeding Up Two String-Matching Algorithms
We show how to speed up two string-matching algorithms: the Boyer-Moore algorithm (BM algorithm), and its version called here the reverse factor algorithm (RF algorithm). The RF al...
Maxime Crochemore, Thierry Lecroq, Artur Czumaj, L...
BICOB
2009
Springer
14 years 2 months ago
Assembly of Large Genomes from Paired Short Reads
The de novo assembly of genomes from high-throughput short reads is an active area of research. Several promising methods have been recently developed, with applicability mainly re...
Benjamin G. Jackson, Patrick S. Schnable, Srinivas...
JSSPP
2005
Springer
14 years 1 months ago
AnthillSched: A Scheduling Strategy for Irregular and Iterative I/O-Intensive Parallel Jobs
Irregular and iterative I/O-intensive jobs need a different approach from parallel job schedulers. The focus in this case is not only the processing requirements anymore: memory, ...
Luís Fabrício Wanderley Góes,...
TKDE
2010
393views more  TKDE 2010»
13 years 2 months ago
Adaptive Join Operators for Result Rate Optimization on Streaming Inputs
Adaptive join algorithms have recently attracted a lot of attention in emerging applications where data is provided by autonomous data sources through heterogeneous network environ...
Mihaela A. Bornea, Vasilis Vassalos, Yannis Kotidi...
PODS
2009
ACM
119views Database» more  PODS 2009»
14 years 8 months ago
Dynamic indexability and lower bounds for dynamic one-dimensional range query indexes
The B-tree is a fundamental external index structure that is widely used for answering one-dimensional range reporting queries. Given a set of N keys, a range query can be answere...
Ke Yi