Sciweavers

136 search results - page 11 / 28
» A Spectral Technique for Correspondence Problems Using Pairw...
Sort
View
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
ECAI
2004
Springer
14 years 2 months ago
Learning Techniques for Automatic Algorithm Portfolio Selection
The purpose of this paper is to show that a well known machine learning technique based on Decision Trees can be effectively used to select the best approach (in terms of efficien...
Alessio Guerri, Michela Milano
3DIM
2011
IEEE
12 years 8 months ago
A Non-cooperative Game for 3D Object Recognition in Cluttered Scenes
Abstract—During the last few years a wide range of algorithms and devices have been made available to easily acquire range images. To this extent, the increasing abundance of dep...
Andrea Albarelli, Emanuele Rodolà, Filippo ...
ENTCS
2008
85views more  ENTCS 2008»
13 years 8 months ago
Comparing CSP and SAT Solvers for Polynomial Constraints in Termination Provers
Proofs of termination in term rewriting involve solving constraints between terms coming from (parts of) the rules of the term rewriting system. A common way to deal with such con...
Salvador Lucas, Rafael Navarro-Marset
AGP
1999
IEEE
14 years 28 days ago
ACI1 constraints
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
Agostino Dovier, Carla Piazza, Enrico Pontelli, Gi...