240 search results - page 9 / 48 » The Tree Inclusion Problem: In Optimal Space and Faster |
FOCS
2006
IEEE
15 years 3 months ago
2006
IEEE
We extend the binary search technique to searching in trees. We consider two models of queries: questions about vertices and questions about edges. We present a general approach t...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
We revisit one of the most fundamental classes of data structure problems in computational geometry: range searching. Back in SoCG’92, Matouˇsek gave a partition tree method fo...
ECAI
2010
Springer
14 years 9 months ago
2010
Springer
Recently the efficiency of an outlier detection algorithm ORCA was improved by RCS (Randomization with faster Cutoff update and Space utilization after pruning), which changes the ...
124
Voted
ECML
2006
Springer
15 years 1 months ago
2006
Springer
We target the problem of closed-loop learning of control policies that map visual percepts to continuous actions. Our algorithm, called Reinforcement Learning of Joint Classes (RLJ...
RSCTC
2000
Springer
15 years 1 months ago
2000
Springer
The main task in decision tree construction algorithms is to find the "best partition" of the set of objects. In this paper, we investigate the problem of optimal binary ...