3640 search results - page 283 / 728 » The Geometry of Web Search |
218
click to vote
COMPGEOM
2010
ACM
15 years 11 months ago
2010
ACM
In this paper, we introduce a simple, randomized dynamic data structure for storing multidimensional point sets, called a quadtreap. This data structure is a randomized, balanced ...
183
click to vote
VC
2008
15 years 6 months ago
2008
Abstract We propose a new featurebased registration method for rigidbody alignment of overlapping point clouds (PCs) efficiently under the influence of noise and outliers. The prop...
178
click to vote
WSDM
2010
ACM
16 years 3 months ago
2010
ACM
This article describes an application of the partially observable Markov (POM) model to the analysis of a large scale commercial web search log. Mathematically, POM is a variant o...
182
click to vote
AIRWEB
2008
Springer
15 years 8 months ago
2008
Springer
Every day millions of users search for information on the web via search engines, and provide implicit feedback to the results shown for their queries by clicking or not onto them...
129
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
One of the most fundamental problems in web search is how to re-rank result web pages based on user logs. Most traditional models for re-ranking assume each query has a single int...