198 search results - page 7 / 40 » Dynamic spatial approximation trees |
ICTAI
2003
IEEE
14 years 3 months ago
2003
IEEE
Computing and storing probabilities is a hard problem as soon as one has to deal with complex distributions over multiples random variables. The problem of efficient representati...
SSD
2005
Springer
14 years 3 months ago
2005
Springer
Most recent research on querying and managing data streams has concentrated on traditional data models where the data come in the form of tuples or XML data. Complex types of strea...
NIPS
2004
13 years 11 months ago
2004
This paper concerns approximate nearest neighbor searching algorithms, which have become increasingly important, especially in high dimensional perception areas such as computer v...
IJCAI
1993
13 years 11 months ago
1993
While decision trees have been used primarily for classification, they can also model regression or function approximation. Like classification trees, regression trees often yield...
ESA
2000
Springer
14 years 1 months ago
2000
Springer
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...