736 search results - page 84 / 148 » A dynamic data structure for approximate range searching |
NAR
2010
13 years 3 months ago
2010
As the amount of biological data grows, so does the need for biologists to store and access this information in central repositories in a free and unambiguous manner. The European...
PODS
2009
ACM
14 years 9 months ago
2009
ACM
Let be a finite, ordered alphabet, and consider a string x = x1x2 . . . xn n . A secondary index for x answers alphabet range queries of the form: Given a range [al, ar] , retu...
SGAI
2007
Springer
14 years 2 months ago
2007
Springer
Novelty detection is a machine learning technique which identifies new or unknown information in large data sets. We present our current work on the construction of a new novelty...
KAIS
2008
13 years 8 months ago
2008
The increasing prominence of data streams arising in a wide range of advanced applications such as fraud detection and trend learning has led to the study of online mining of freq...
DAGSTUHL
2007
13 years 10 months ago
2007
Binary search trees are a fundamental data structure and their height plays a key role in the analysis of divide-and-conquer algorithms like quicksort. Their worst-case height is l...