Sciweavers

559 search results - page 24 / 112
» Algorithms and Data Structures for External Memory
Sort
View
ALENEX
2008
192views Algorithms» more  ALENEX 2008»
15 years 3 months ago
Compressed Inverted Indexes for In-Memory Search Engines
We present the algorithmic core of a full text data base that allows fast Boolean queries, phrase queries, and document reporting using less space than the input text. The system ...
Frederik Transier, Peter Sanders
WSCG
2000
153views more  WSCG 2000»
15 years 3 months ago
RaFSi - A Fast Watershed Algorithm Based on Rainfalling Simulation
In this paper, we present a fast watershed algorithm based on the rainfalling simulation. We present the various techniques and data structures utilized in our approach. Throughou...
Stanislav L. Stoev
ICPP
2006
IEEE
15 years 8 months ago
A Parallel, Out-of-Core Algorithm for RNA Secondary Structure Prediction
RNA pseudoknot prediction is an algorithm for RNA sequence search and alignment. An important building block towards pseudoknot prediction is RNA secondary structure prediction. T...
Wenduo Zhou, David K. Lowenthal
137
Voted
SIGCOMM
2010
ACM
15 years 2 months ago
DDE: dynamic data structure excavation
Dynamic Datastructure Excavation (DDE) is a new approach to extract datastructures from C binaries without any need for debugging symbols. Unlike most existing tools, DDE uses dyn...
Asia Slowinska, Traian Stancescu, Herbert Bos
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
15 years 3 months ago
Oblivious RAM Revisited
We reinvestigate the oblivious RAM concept introduced by Goldreich and Ostrovsky, which enables a client, that can store locally only a constant amount of data, to store remotely ...
Benny Pinkas, Tzachy Reinman