3055 search results - page 365 / 611 » Randomized Search Trees |
143
click to vote
STOC
2009
ACM
16 years 4 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
123
click to vote
ICDM
2009
IEEE
15 years 10 months ago
2009
IEEE
—Methods for learning decision rules are being successfully applied to many problem domains, especially where understanding and interpretation of the learned model is necessary. ...
124
click to vote
KDD
2002
ACM
16 years 4 months ago
2002
ACM
In this paper, we present a novel algorithm OpportuneProject for mining complete set of frequent item sets by projecting databases to grow a frequent item set tree. Our algorithm ...
147
click to vote
CIVR
2009
Springer
15 years 10 months ago
2009
Springer
Sequence matching techniques are effective for comparing two videos. However, existing approaches suffer from demanding computational costs and thus are not scalable for large-sca...
150
click to vote
CP
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Most CSP algorithms are based on refinements and extensions of backtracking, and employ one of two simple “branching schemes”: 2-way branching or d-way branching, fo...