2127 search results - page 240 / 426 » Computing large matchings fast |
139
click to vote
ICCV
2001
IEEE
16 years 6 months ago
2001
IEEE
Tree-structured probabilistic models admit simple, fast inference. However, they are not well suited to phenomena such as occlusion, where multiple components of an object may dis...
153
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
165
Voted
CVPR
2010
IEEE
16 years 18 days ago
2010
IEEE
Searching approximate nearest neighbors in large scale high dimensional data set has been a challenging problem. This paper presents a novel and fast algorithm for learning binary...
130
Voted
CGF
2002
15 years 4 months ago
2002
Parameterization of discrete surfaces is a fundamental and widely-used operation in graphics, required, for instance, for texture mapping or remeshing. As 3D data becomes more and...
158
click to vote
NOMS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract— Today’s networked systems are extensively instrumented for collecting a wealth of monitoring data. In this paper, we propose a framework called System-wide Similarity...