Sciweavers

176 search results - page 6 / 36
» A Clustering Approach to Solving Large Stochastic Matching P...
Sort
View
CSCLP
2006
Springer
13 years 11 months ago
Efficient Recognition of Acyclic Clustered Constraint Satisfaction Problems
Abstract. In this paper we present a novel approach to solving Constraint Satisfaction Problems whose constraint graphs are highly clustered and the graph of clusters is close to b...
Igor Razgon, Barry O'Sullivan
IJCV
2008
157views more  IJCV 2008»
13 years 7 months ago
Pairwise Matching of 3D Fragments Using Cluster Trees
Abstract We propose a novel and efficient surface matching approach for reassembling broken solids as well as for matching assembly components using cluster trees of oriented point...
Simon Winkelbach, Friedrich M. Wahl
ICDAR
2009
IEEE
13 years 5 months ago
Stochastic Segment Modeling for Offline Handwriting Recognition
In this paper, we present a novel approach for incorporating structural information into the hidden Markov Modeling (HMM) framework for offline handwriting recognition. Traditiona...
Premkumar Natarajan, Krishna Subramanian, Anurag B...
CORR
2010
Springer
125views Education» more  CORR 2010»
13 years 7 months ago
Local search for stable marriage problems with ties and incomplete lists
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
JSW
2007
118views more  JSW 2007»
13 years 7 months ago
A New Formalism for Failure Diagnosis: Ant Colony Decision Petri Nets
— Failure diagnosis in large and complex systems is a critical task. A discrete event system (DES) approach to the problem of failure diagnosis is presented in this paper. A clas...
Calin Ciufudean, Adrian Graur, Constantin Filote, ...