4850 search results - page 280 / 970 » Approximate Data Structures with Applications |
173
click to vote
CANDC
2000
ACM
15 years 6 months ago
2000
ACM
A new statistical model for DNA considers a sequence to be a mixture of regions with little structure and regions that are approximate repeats of other subsequences, i.e. instance...
219
click to vote
PODS
2006
ACM
16 years 6 months ago
2006
ACM
In this paper, we give a simple scheme for identifying approximate frequent items over a sliding window of size n. Our scheme is deterministic and does not make any assumption on ...
198
click to vote
BMCBI
2005
15 years 6 months ago
2005
Background: Coalescent simulations are playing a large role in interpreting large scale intraspecific sequence or polymorphism surveys and for planning and evaluating association ...
172
click to vote
HICSS
1999
IEEE
15 years 11 months ago
1999
IEEE
This paper reports on research on the generation of hypermedia (Web) applications for querying multimedia databases. In [5] we have proposed a heuristic algorithm for generating n...
205
click to vote
PLDI
2012
ACM
13 years 9 months ago
2012
ACM
Automatic parallelization is a promising strategy to improve application performance in the multicore era. However, common programming practices such as the reuse of data structur...