182 search results - page 30 / 37 » Discovery of Similarity Computations of Search Engines |
145
click to vote
ICML
2009
IEEE
16 years 6 months ago
2009
IEEE
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...
148
click to vote
WEBI
2010
Springer
15 years 3 months ago
2010
Springer
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...
165
click to vote
MSR
2006
ACM
16 years 23 hour ago
2006
ACM
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...
178
Voted
SIGMOD
2010
ACM
15 years 11 months ago
2010
ACM
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...
169
click to vote
KDD
2008
ACM
16 years 6 months ago
2008
ACM
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...