9209 search results - page 417 / 1842 » Data Space Randomization |
175
click to vote
CCCG
2008
15 years 8 months ago
2008
We consider a generalization of geometric range searching, with the goal of generating an informative "summary" of the objects contained in a query range via the applica...
127
click to vote
CACM
2008
15 years 7 months ago
2008
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
208
click to vote
MCS
2007
Springer
16 years 29 days ago
2007
Springer
Rotation Forest is a recently proposed method for building classifier ensembles using independently trained decision trees. It was found to be more accurate than bagging, AdaBoost...
198
click to vote
DAGM
2010
Springer
15 years 8 months ago
2010
Springer
Abstract. A successful approach to tracking is to on-line learn discriminative classifiers for the target objects. Although these trackingby-detection approaches are usually fast a...
214
click to vote
CCR
2004
15 years 6 months ago
2004
There has been much interest in both unstructured and structured overlays recently. Unstructured overlays, like Gnutella, build a random graph and use flooding or random walks on ...