3055 search results - page 139 / 611 » Randomized Search Trees |
107
Voted
CA
2002
IEEE
15 years 5 months ago
2002
IEEE
Complex virtual environments can be simulated with physical or procedural motion. Physical motion is more realistic, but requires the integration of an ordinary differential equat...
108
click to vote
ICALP
2001
Springer
15 years 5 months ago
2001
Springer
We prove a lower bound of (n4/3 log1/3 n) on the randomized decision tree complexity of any nontrivial monotone n-vertex graph property, and of any nontrivial monotone bipartite g...
135
Voted
CISS
2007
IEEE
15 years 4 months ago
2007
IEEE
The problem of routing of sensor observations for optimal detection of a Markov random field (MRF) at a designated fusion center is analyzed. Assuming that the correlation structur...
121
Voted
CVPR
2005
IEEE
16 years 2 months ago
2005
IEEE
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
106
Voted
KDD
2009
ACM
16 years 1 months ago
2009
ACM
We present an algorithm, called the offset tree, for learning in situations where a loss associated with different decisions is not known, but was randomly probed. The algorithm i...