1951 search results - page 89 / 391 » An algorithm for improving graph partitions |
205
Voted
CVPR
2011
IEEE
15 years 1 months ago
2011
IEEE
In this paper, we exploit a novel ranking mechanism that processes query samples with noisy labels, motivated by the practical application of web image search re-ranking where the...
174
click to vote
DMTCS
2010
15 years 3 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
174
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
This paper studies constant-time approximation algorithms for problems on degree-bounded graphs. Let n and d be the number of vertices and the degree bound, respectively. This pap...
171
click to vote
ADBIS
2007
Springer
16 years 10 days ago
2007
Springer
The M-tree and its variants have been proved to provide an efficient similarity search in database environments. In order to further improve their performance, in this paper we pro...
195
Voted
CVPR
2011
IEEE
15 years 2 months ago
2011
IEEE
A convenient way of dealing with image sets is to represent them as points on Grassmannian manifolds. While several recent studies explored the applicability of discriminant analy...