7215 search results - page 55 / 1443 » On the Consistency of Ranking Algorithms |
STOC
2012
ACM
13 years 6 days ago
2012
ACM
IWOCA
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Although there exist many polynomial algorithms for NPhard problems running on a bounded clique-width expression of the input graph, there exists only little comparable w...
107
click to vote
PODS
2012
ACM
13 years 6 days ago
2012
ACM
We show that randomization can lead to significant improvements for a few fundamental problems in distributed tracking. Our basis is the count-tracking problem, where there are k...
118
click to vote
VLC
2008
14 years 9 months ago
2008
Given the difficulty of setting up large-scale experiments with real users, the comparison of content-based image retrieval methods using relevance feedback usually relies on the ...
TSP
2008
14 years 9 months ago
2008
Abstract--Low-rank matrix approximation has applications in many fields, such as 2D filter design and 3D reconstruction from an image sequence. In this paper, one issue with low-ra...