292 search results - page 9 / 59 » Proving Consistency of Pure Methods and Model Fields |
AI
2010
Springer
14 years 9 months ago
2010
Springer
The Valued Constraint Satisfaction Problem (VCSP) is a generic optimization problem defined by a network of local cost functions defined over discrete variables. It has applicatio...
98
Voted
ISVC
2010
Springer
14 years 10 months ago
2010
Springer
We present a method for nonrigid registration of 2-D geometric shapes. Our contribution is twofold. First, we extend the classic chamfer-matching energy to a variational functional...
127
click to vote
ICDAR
2009
IEEE
14 years 7 months ago
2009
IEEE
The paper describes a new approach using a Conditional Random Fields (CRFs) to extract physical and logical layouts in unconstrained handwritten letters such as those sent by indi...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Abstract. Monotone systems of polynomial equations (MSPEs) are systems of fixedpoint equations X1 = f1(X1, . . . , Xn), . . . , Xn = fn(X1, . . . , Xn) where each fi is a polynomia...
WSC
1998
14 years 11 months ago
1998
In this paper we compare the average performance of one class of low-discrepancy quasi-Monte Carlo sequences for global optimization. Weiner measure is assumed as the probability ...