Sciweavers

3652 search results - page 304 / 731
» A study of query length
Sort
View
154
Voted
SIAMDM
2010
137views more  SIAMDM 2010»
15 years 2 months ago
Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods
In this paper we study the problem of finding maximally sized subsets of binary strings (codes) of equal length that are immune to a given number r of repetitions, in the sense th...
Lara Dolecek, Venkat Anantharam
ICDE
2010
IEEE
801views Database» more  ICDE 2010»
16 years 3 months ago
The Similarity Join Database Operator
Similarity joins have been studied as key operations in multiple application domains, e.g., record linkage, data cleaning, multimedia and video applications, and phenomena detectio...
Mohamed H. Ali, Walid G. Aref, Yasin N. Silva
238
Voted
SASP
2009
IEEE
291views Hardware» more  SASP 2009»
15 years 10 months ago
A parameterisable and scalable Smith-Waterman algorithm implementation on CUDA-compatible GPUs
—This paper describes a multi-threaded parallel design and implementation of the Smith-Waterman (SM) algorithm on compute unified device architecture (CUDA)-compatible graphic pr...
Cheng Ling, Khaled Benkrid, Tsuyoshi Hamada
125
Voted
BTW
2009
Springer
166views Database» more  BTW 2009»
15 years 10 months ago
TinTO: A Tool for View-Based Analysis of Stock Market Data Streams
: TinTO is an experimental system aiming at demonstrating the usefulness and feasibility of incrementally evaluated SQL queries for analyzing a wide spectrum of data streams. As ap...
Andreas Behrend, Christian Dorau, Rainer Manthey
131
Voted
SPIRE
2009
Springer
15 years 10 months ago
On Entropy-Compressed Text Indexing in External Memory
A new trend in the field of pattern matching is to design indexing data structures which take space very close to that required by the indexed text (in entropy-compressed form) an...
Wing-Kai Hon, Rahul Shah, Sharma V. Thankachan, Je...