114 search results - page 9 / 23 » The Tree Inclusion Problem: In Linear Space and Faster |
STOC
2006
ACM
15 years 9 months ago
2006
ACM
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
115
click to vote
ICDM
2010
IEEE
14 years 7 months ago
2010
IEEE
Regression problems on massive data sets are ubiquitous in many application domains including the Internet, earth and space sciences, and finances. In many cases, regression algori...
111
click to vote
MMM
2011
Springer
14 years 1 months ago
2011
Springer
Abstract. Efficient nearest neighbor (NN) search techniques for highdimensional data are crucial to content-based image retrieval (CBIR). Traditional data structures (e.g., kd-tree...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
102
Voted
CONSTRAINTS
2010
14 years 9 months ago
2010
AND/OR search spaces accommodate advanced algorithmic schemes for graphical models which can exploit the structure of the model. We extend and evaluate the depth-first and best-fi...