Sciweavers

1376 search results - page 2 / 276
» Searching Trees: An Essay
Sort
View
SDM
2012
SIAM
224views Data Mining» more  SDM 2012»
11 years 8 months ago
Nearest-Neighbor Search on a Time Budget via Max-Margin Trees
Many high-profile applications pose high-dimensional nearest-neighbor search problems. Yet, it still remains difficult to achieve fast query times for state-of-the-art approache...
Parikshit Ram, Dongryeol Lee, Alexander G. Gray
KDD
2012
ACM
186views Data Mining» more  KDD 2012»
11 years 8 months ago
Maximum inner-product search using cone trees
The problem of efficiently finding the best match for a query in a given set with respect to the Euclidean distance or the cosine similarity has been extensively studied. However...
Parikshit Ram, Alexander G. Gray
AAAI
2012
11 years 8 months ago
Generalized Monte-Carlo Tree Search Extensions for General Game Playing
General Game Playing (GGP) agents must be capable of playing a wide variety of games skillfully. Monte-Carlo Tree Search (MCTS) has proven an effective reasoning mechanism for thi...
Hilmar Finnsson
IANDC
2008
101views more  IANDC 2008»
13 years 5 months ago
Trees with exponentially growing costs
We investigate code trees and search trees with cost functions that increase exponentially with the depth in the tree. While corresponding coding theorems have been considered in ...
Frank Schulz
ALGORITHMICA
2006
174views more  ALGORITHMICA 2006»
13 years 5 months ago
Profiles of Random Trees: Limit Theorems for Random Recursive Trees and Binary Search Trees
We prove convergence in distribution for the profile (the number of nodes at each level), normalized by its mean, of random recursive trees when the limit ratio of the level and ...
Michael Fuchs, Hsien-Kuei Hwang, Ralph Neininger