Sciweavers

3055 search results - page 79 / 611
» Randomized Search Trees
Sort
View
CORR
2011
Springer
169views Education» more  CORR 2011»
13 years 5 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
EVOW
2010
Springer
14 years 4 months ago
Multiple Overlapping Tiles for Contextual Monte Carlo Tree Search
Monte Carlo Tree Search is a recent algorithm that achieves more and more successes in various domains. We propose an improvement of the Monte Carlo part of the algorithm by modify...
Arpad Rimmel, Fabien Teytaud
WEBDB
2010
Springer
167views Database» more  WEBDB 2010»
14 years 3 months ago
Tree patterns with Full Text Search
Tree patterns with full text search form the core of both XQuery Full Text and the NEXI query language. On such queries, users expect a relevance-ranked list of XML elements as an...
Maria-Hendrike Peetz, Maarten Marx
WWW
2010
ACM
14 years 5 months ago
The paths more taken: matching DOM trees to search logs for accurate webpage clustering
An unsupervised clustering of the webpages on a website is a primary requirement for most wrapper induction and automated data extraction methods. Since page content can vary dras...
Deepayan Chakrabarti, Rupesh R. Mehta
WWW
2011
ACM
13 years 5 months ago
Parallel boosted regression trees for web search ranking
Gradient Boosted Regression Trees (GBRT) are the current state-of-the-art learning paradigm for machine learned websearch ranking — a domain notorious for very large data sets. ...
Stephen Tyree, Kilian Q. Weinberger, Kunal Agrawal...