Sciweavers

182 search results - page 30 / 37
» Discovery of Similarity Computations of Search Engines
Sort
View
ICML
2009
IEEE
14 years 8 months ago
Monte-Carlo simulation balancing
In this paper we introduce the first algorithms for efficiently learning a simulation policy for Monte-Carlo search. Our main idea is to optimise the balance of a simulation polic...
David Silver, Gerald Tesauro
WEBI
2010
Springer
13 years 5 months ago
Hierarchical Cost-Sensitive Web Resource Acquisition for Record Matching
Web information is increasingly used as evidence in solving various problems, including record matching. However, acquiring web-based resources is slow and can incur other access c...
Yee Fan Tan, Min-Yen Kan
MSR
2006
ACM
14 years 1 months ago
An open framework for CVS repository querying, analysis and visualization
We present an open framework for visual mining of CVS software repositories. We address three aspects: data extraction, analysis and visualization. We first discuss the challenges...
Lucian Voinea, Alexandru Telea
SIGMOD
2010
ACM
186views Database» more  SIGMOD 2010»
14 years 9 days ago
Fast approximate correlation for massive time-series data
We consider the problem of computing all-pair correlations in a warehouse containing a large number (e.g., tens of thousands) of time-series (or, signals). The problem arises in a...
Abdullah Mueen, Suman Nath, Jie Liu
KDD
2008
ACM
183views Data Mining» more  KDD 2008»
14 years 7 months ago
De-duping URLs via rewrite rules
A large fraction of the URLs on the web contain duplicate (or near-duplicate) content. De-duping URLs is an extremely important problem for search engines, since all the principal...
Anirban Dasgupta, Ravi Kumar, Amit Sasturkar