Sciweavers

2843 search results - page 197 / 569
» Interpolation by geometric algorithm
Sort
View
SIAMSC
2011
148views more  SIAMSC 2011»
14 years 10 months ago
Bootstrap AMG
We develop an algebraic multigrid (AMG) setup scheme based on the bootstrap framework for multiscale scientific computation. Our approach uses a weighted least squares definition...
Achi Brandt, James J. Brannick, K. Kahl, Irene Liv...
MICCAI
2009
Springer
16 years 4 months ago
Setting Priors and Enforcing Constraints on Matches for Nonlinear Registration of Meshes
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...
Benoît Combès, Sylvain Prima
119
Voted
ICPR
2010
IEEE
15 years 10 months ago
Robust Matching in an Uncertain World
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...
Frédéric Sur
113
Voted
GD
2009
Springer
15 years 7 months ago
More Flexible Radial Layout
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...
Ulrik Brandes, Christian Pich
130
Voted
NIPS
2008
15 years 5 months ago
ICA based on a Smooth Estimation of the Differential Entropy
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...
Lev Faivishevsky, Jacob Goldberger