2342 search results - page 137 / 469 » Sublinear geometric algorithms |
MICCAI
2009
Springer
16 years 4 months ago
2009
Springer
Abstract. We show that a simple probabilistic modelling of the registration problem for surfaces allows to solve it by using standard clustering techniques. In this framework, poin...
115
Voted
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
Finding point correspondences which are consistent with a geometric constraint is one of the cornerstones of many computer vision problems. This is a difficult task because of sp...
108
click to vote
GD
2009
Springer
15 years 6 months ago
2009
Springer
We describe an algorithm for radial layout of undirected graphs, in which nodes are constrained to concentric circles centered at the origin. Such constraints are typical, e.g., i...
118
click to vote
NIPS
2008
15 years 4 months ago
2008
In this paper we introduce the MeanNN approach for estimation of main information theoretic measures such as differential entropy, mutual information and divergence. As opposed to...
106
Voted
NIPS
2004
15 years 4 months ago
2004
This paper investigates a new learning model in which the input data is corrupted with noise. We present a general statistical framework to tackle this problem. Based on the stati...