Sciweavers

2089 search results - page 21 / 418
» Finding Environment Guarantees
Sort
View
SIGMOD
2008
ACM
164views Database» more  SIGMOD 2008»
14 years 7 months ago
Finding frequent items in probabilistic data
Computing statistical information on probabilistic data has attracted a lot of attention recently, as the data generated from a wide range of data sources are inherently fuzzy or ...
Qin Zhang, Feifei Li, Ke Yi
IEAAIE
1994
Springer
13 years 11 months ago
Using the Genetic Algorithm to Find Snake-in-the-Box Codes
Genetic Algorithms are heuristic search schemes based on a model of Darwinian evolution. Although not guaranteed to find the optimal solution, genetic algorithms have been shown t...
Walter D. Potter, Robert W. Robinson, John A. Mill...
PAMI
2008
152views more  PAMI 2008»
13 years 7 months ago
K-Nearest Neighbor Finding Using MaxNearestDist
Abstract-Similarity searching often reduces to finding the k nearest neighbors to a query object. Finding the k nearest neighbors is achieved by applying either a depth-first or a ...
Hanan Samet
RECOMB
2005
Springer
14 years 7 months ago
Improved Pattern-Driven Algorithms for Motif Finding in DNA Sequences
Abstract. In order to guarantee that the optimal motif is found, traditional pattern-driven approaches perform an exhaustive search over all candidate motifs of length l. We develo...
Sing-Hoi Sze, Xiaoyan Zhao
SIGMOD
2004
ACM
144views Database» more  SIGMOD 2004»
14 years 7 months ago
Diamond in the Rough: Finding Hierarchical Heavy Hitters in Multi-Dimensional Data
Data items archived in data warehouses or those that arrive online as streams typically have attributes which take values from multiple hierarchies (e.g., time and geographic loca...
Graham Cormode, Flip Korn, S. Muthukrishnan, Dives...