Sciweavers

829 search results - page 34 / 166
» Bandit Algorithms for Tree Search
Sort
View
GIS
2010
ACM
14 years 8 months ago
Location disambiguation in local searches using gradient boosted decision trees
Local search is a specialization of the web search that allows users to submit geographically constrained queries. However, one of the challenges for local search engines is to un...
Ritesh Agrawal, James G. Shanahan
JDCTA
2010
152views more  JDCTA 2010»
14 years 4 months ago
Spatial Clustering Algorithm Based on Hierarchical-Partition Tree
In spatial clustering, the scale of spatial data is usually very large. Spatial clustering algorithms need high performance, good scalability, and are able to deal with noise and ...
Zhongzhi Li, Xuegang Wang
JAL
2002
113views more  JAL 2002»
14 years 9 months ago
A multivariate view of random bucket digital search trees
We take a multivariate view of digital search trees by studying the number of nodes of different types that may coexist in a bucket digital search tree as it grows under an arbitr...
Friedrich Hubalek, Hsien-Kuei Hwang, William Lew, ...
ISMIR
2005
Springer
157views Music» more  ISMIR 2005»
15 years 3 months ago
A Partial Searching Algorithm and Its Application for Polyphonic Music Transcription
This paper proposes an algorithm for studying spectral contents of pitched sounds in real-world recordings. We assume that the 2nd -order difference, w.r.t. partial index, of a pi...
Wen Xue, M. Sandler
DATE
2002
IEEE
91views Hardware» more  DATE 2002»
15 years 2 months ago
An Enhanced Q-Sequence Augmented with Empty-Room-Insertion and Parenthesis Trees
After the discussion on the difference between floorplanning and packing in VLSI placement design, this paper adapts the floorplanner that is based on the Q-sequence to a packin...
Changwen Zhuang, Yoji Kajitani, Keishi Sakanushi, ...