3875 search results - page 739 / 775 » Approximation Algorithms for the Max-coloring Problem |
144
Voted
ECCV
2002
Springer
16 years 4 months ago
2002
Springer
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
116
click to vote
KDD
2006
ACM
16 years 3 months ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...
121
Voted
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
103
Voted
CIKM
2007
Springer
15 years 8 months ago
2007
Springer
The problem of results merging in distributed information retrieval environments has been approached by two different directions in research. Estimation approaches attempt to cal...
118
Voted
HPDC
2003
IEEE
15 years 8 months ago
2003
IEEE
This paper defines and describes a fully distributed implementation of Google’s highly effective Pagerank algorithm, for “peer to peer”(P2P) systems. The implementation is ...