304 search results - page 28 / 61 » Dynamic ordered sets with exponential search trees |
BIBE
2006
IEEE
14 years 2 months ago
2006
IEEE
DNA sequence alignment is a critical step in identifying homology between organisms. The most widely used alignment program, ClustalW, is known to suffer from the local minima pro...
INFOCOM
2006
IEEE
14 years 2 months ago
2006
IEEE
Abstract— A bloom filter is a simple, space-efficient, randomized data structure for concisely representing a static data set, in order to support approximate membership querie...
FAST
2004
13 years 10 months ago
2004
This paper explores the concept of early discard for interactive search of unindexed data. Processing data inside storage devices using downloaded searchlet code enables Diamond t...
SIGMOD
2009
ACM
14 years 8 months ago
2009
ACM
Composite (or Complex) event processing (CEP) systems search sequences of incoming events for occurrences of userspecified event patterns. Recently, they have gained more attentio...
CP
2009
Springer
14 years 9 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...