126 search results - page 21 / 26 » Finding low-entropy sets and trees from binary data |
128
Voted
CSR
2006
Springer
15 years 5 months ago
2006
Springer
Regular expression pattern matching is widely used in computational biology. Searching through a database of sequences for a motif (a simple regular expression), or its variations...
PODC
2009
ACM
16 years 2 months ago
2009
ACM
A method is given for constructing a max register, a linearizable, wait-free concurrent data structure that supports a write operation and a read operation that returns the larges...
131
click to vote
COMPGEOM
2006
ACM
15 years 5 months ago
2006
ACM
Despite extensive study over the last four decades and numerous applications, no I/O-efficient algorithm is known for the union-find problem. In this paper we present an I/O-effic...
125
Voted
CIKM
2008
Springer
15 years 3 months ago
2008
Springer
We propose a dynamic faceted search system for discoverydriven analysis on data with both textual content and structured attributes. From a keyword query, we want to dynamically s...
121
Voted
ICDE
2010
IEEE
16 years 1 months ago
2010
IEEE
Abstract-- This work presents a novel index structure, MHRtree, for efficiently answering approximate string match queries in large spatial databases. The MHR-tree is based on the ...