Sciweavers

783 search results - page 1 / 157
» Modeling High-Dimensional Index Structures using Sampling
Sort
View
SIGMOD
2001
ACM
91views Database» more  SIGMOD 2001»
14 years 5 months ago
Modeling High-Dimensional Index Structures using Sampling
Christian A. Lang, Ambuj K. Singh
ICDT
2001
ACM
116views Database» more  ICDT 2001»
13 years 9 months ago
On Optimizing Nearest Neighbor Queries in High-Dimensional Data Spaces
Abstract. Nearest-neighbor queries in high-dimensional space are of high importance in various applications, especially in content-based indexing of multimedia data. For an optimiz...
Stefan Berchtold, Christian Böhm, Daniel A. K...
PCM
2001
Springer
183views Multimedia» more  PCM 2001»
13 years 9 months ago
An Adaptive Index Structure for High-Dimensional Similarity Search
A practical method for creating a high dimensional index structure that adapts to the data distribution and scales well with the database size, is presented. Typical media descrip...
Peng Wu, B. S. Manjunath, Shivkumar Chandrasekaran
EDBT
2000
ACM
13 years 9 months ago
Dynamically Optimizing High-Dimensional Index Structures
In high-dimensional query processing, the optimization of the logical page-size of index structures is an important research issue. Even very simple query processing techniques suc...
Christian Böhm, Hans-Peter Kriegel
CORR
2010
Springer
96views Education» more  CORR 2010»
13 years 4 months ago
Learning High-Dimensional Markov Forest Distributions: Analysis of Error Rates
The problem of learning forest-structured discrete graphical models from i.i.d. samples is considered. An algorithm based on pruning of the Chow-Liu tree through adaptive threshol...
Vincent Y. F. Tan, Animashree Anandkumar, Alan S. ...