Sciweavers

3688 search results - page 470 / 738
» Requirements of Phylogenetic Databases
Sort
View
DCC
2010
IEEE
16 years 1 months ago
LZ77-Like Compression with Fast Random Access
We introduce an alternative Lempel-Ziv text parsing, LZ-End, that converges to the entropy and in practice gets very close to LZ77. LZ-End forces sources to finish at the end of ...
Sebastian Kreft, Gonzalo Navarro
ICASSP
2009
IEEE
16 years 1 months ago
LSH banding for large-scale retrieval with memory and recall constraints
Locality Sensitive Hashing (LSH) is widely used for efficient retrieval of candidate matches in very large audio, video, and image systems. However, extremely large reference dat...
Michele Covell, Shumeet Baluja
ICDAR
2009
IEEE
16 years 1 months ago
Segmentation-free Word Spotting in Historical Printed Documents
In this paper, a new efficient word spotting methodology is presented that can be applied to historical printed documents without requiring any previous block or word segmentation...
Basilios Gatos, Ioannis Pratikakis
WABI
2009
Springer
128views Bioinformatics» more  WABI 2009»
16 years 1 months ago
A General Framework for Local Pairwise Alignment Statistics with Gaps
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
Pasi Rastas
CIKM
2009
Springer
16 years 1 months ago
Leveraging a scalable row store to build a distributed text index
Many content-oriented applications require a scalable text index. Building such an index is challenging. In addition to the logic of inserting and searching documents, developers ...
Ning Li, Jun Rao, Eugene J. Shekita, Sandeep Tata