Sciweavers

271 search results - page 51 / 55
» Evaluating strategies for similarity search on the web
Sort
View
WSDM
2009
ACM
140views Data Mining» more  WSDM 2009»
15 years 4 months ago
Effective latent space graph-based re-ranking model with global consistency
Recently the re-ranking algorithms have been quite popular for web search and data mining. However, one of the issues is that those algorithms treat the content and link informati...
Hongbo Deng, Michael R. Lyu, Irwin King
WWW
2010
ACM
15 years 4 months ago
Generalized distances between rankings
Spearman’s footrule and Kendall’s tau are two well established distances between rankings. They, however, fail to take into account concepts crucial to evaluating a result set...
Ravi Kumar, Sergei Vassilvitskii
SIGMOD
2006
ACM
171views Database» more  SIGMOD 2006»
15 years 9 months ago
Communication-efficient distributed monitoring of thresholded counts
Monitoring is an issue of primary concern in current and next generation networked systems. For example, the objective of sensor networks is to monitor their surroundings for a va...
Ram Keralapura, Graham Cormode, Jeyashankher Ramam...
75
Voted
CEC
2010
IEEE
14 years 8 months ago
Gaussian Adaptation as a unifying framework for continuous black-box optimization and adaptive Monte Carlo sampling
Abstract— We present a unifying framework for continuous optimization and sampling. This framework is based on Gaussian Adaptation (GaA), a search heuristic developed in the late...
Christian L. Müller, Ivo F. Sbalzarini
WWW
2010
ACM
15 years 4 months ago
Measurement-calibrated graph models for social network experiments
Access to realistic, complex graph datasets is critical to research on social networking systems and applications. Simulations on graph data provide critical evaluation of new sys...
Alessandra Sala, Lili Cao, Christo Wilson, Robert ...