Sciweavers

365 search results - page 26 / 73
» Numerical Solving of Geometric Constraints
Sort
View
PROCEDIA
2011
14 years 4 months ago
Exact Closest String as a Constraint Satisfaction Problem
We report the first evaluation of Constraint Satisfaction as a computational framework for solving closest string problems. We show that careful consideration of symbol occurrenc...
Tom Kelsey, Lars Kotthoff
130
Voted
ICMLA
2010
14 years 12 months ago
Classification Models with Global Constraints for Ordinal Data
Ordinal classification is a form of multi-class classification where there is an inherent ordering between the classes, but not a meaningful numeric difference between them. Althou...
Jaime S. Cardoso, Ricardo Sousa
106
Voted
JCST
2006
119views more  JCST 2006»
15 years 1 months ago
Constraint-Based Fuzzy Models for an Environment with Heterogeneous Information-Granules
:- A novel constraint-based fuzzy modeling approach is proposed. Features of the proposed model are enumerated as below. 1)The knowledge base of a constraint-based fuzzy model can ...
K. Robert Lai, Yi-Yuan Chiang
IJCV
1998
103views more  IJCV 1998»
15 years 1 months ago
Dense Non-Rigid Motion Estimation in Sequences of Medical Images Using Differential Constraints
We describe a new method for computing the displacement vector field in time sequences of 2D or 3D images (4D data). The method is energy-minimizing on the space of correspondence...
Serge Benayoun, Nicholas Ayache
106
Voted
AAAI
1990
15 years 3 months ago
Some Applications of Graph Bandwidth to Constraint Satisfaction Problems
Bandwidth is a fundamental concept in graph theory which has some surprising applications to a class of AI search problems. Graph bandwidth provides a link between the syntactic s...
Ramin Zabih