4536 search results - page 577 / 908 » Contention-Sensitive Data Structures and Algorithms |
170
click to vote
CIKM
2008
Springer
15 years 8 months ago
2008
Springer
We propose a new method to build persistent suffix trees for indexing the genomic data. Our algorithm DiGeST (Disk-Based Genomic Suffix Tree) improves significantly over previous ...
157
click to vote
IADIS
2008
15 years 8 months ago
2008
Marketing databases are currently one of the most important resources in any marketing departments. Regarding their customer knowledge needs many of them had develop their own dat...
193
click to vote
NIPS
2004
15 years 8 months ago
2004
Many machine learning algorithms for clustering or dimensionality reduction take as input a cloud of points in Euclidean space, and construct a graph with the input data points as...
220
click to vote
AMAI
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. This paper is concerned with the reliable inference of optimal treeapproximations to the dependency structure of an unknown distribution generating data. The traditional ...
196
click to vote
SIGIR
2006
ACM
16 years 21 days ago
2006
ACM
We consider the following full-text search autocompletion feature. Imagine a user of a search engine typing a query. Then with every letter being typed, we would like an instant d...