Sciweavers

365 search results - page 12 / 73
» Numerical Solving of Geometric Constraints
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Geometric programming for aggregation of binary classifiers
Multiclass classification problems are often decomposed into multiple binary problems that are solved by individual binary classifiers whose results are integrated into a final...
Sunho Park, Seungjin Choi
MICCAI
2009
Springer
14 years 9 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
ICCV
2003
IEEE
14 years 10 months ago
Scene Modeling Based on Constraint System Decomposition Techniques
We present a new approach to 3D scene modeling based on geometric constraints. Contrary to the existing methods, we can quickly obtain 3D scene models that respect the given const...
Marta Wilczkowiak, Gilles Trombettoni, Christophe ...
PODS
2008
ACM
128views Database» more  PODS 2008»
14 years 8 months ago
Shape sensitive geometric monitoring
A fundamental problem in distributed computation is the distributed evaluation of functions. The goal is to determine the value of a function over a set of distributed inputs, in ...
Izchak Sharfman, Assaf Schuster, Daniel Keren
ESA
1995
Springer
182views Algorithms» more  ESA 1995»
13 years 11 months ago
A Geometric Approach to Betweenness
An input to the betweenness problem contains m constraints over n real variables (points). Each constraint consists of three points, where one of the points is specified to lie in...
Benny Chor, Madhu Sudan