3055 search results - page 413 / 611 » Randomized Search Trees |
135
click to vote
ICCV
1999
IEEE
16 years 6 months ago
1999
IEEE
Existing sequential feature-based registration algorithms involving search typically either select features randomly (eg. the RANSAC[8] approach) or assume a predefined, intuitive...
231
click to vote
GIS
2008
ACM
16 years 5 months ago
2008
ACM
In this paper, we describe a methodology to estimate the geographic coverage of the web without the need for secondary knowledge or complex geo-tagging. This is achieved by random...
129
click to vote
KDD
2008
ACM
16 years 4 months ago
2008
ACM
We introduce a new approach to analyzing click logs by examining both the documents that are clicked and those that are bypassed--documents returned higher in the ordering of the ...
134
click to vote
KDD
2007
ACM
16 years 4 months ago
2007
ACM
We address the task of learning rankings of documents from search engine logs of user behavior. Previous work on this problem has relied on passively collected clickthrough data. ...
140
click to vote
ICS
2010
Tsinghua U.
16 years 1 months ago
2010
Tsinghua U.
In this paper we study the possibility of proving the existence of one-way functions based on average case hardness. It is well-known that if there exists a polynomial-time sample...