919 search results - page 20 / 184 » Improved analysis methods for crossover-based algorithms |
123
click to vote
ICDAR
2009
IEEE
15 years 8 months ago
2009
IEEE
This paper describes a method of on-line handwritten Japanese text recognition by improved path evaluation. Based on a theoretical ground, the method evaluates the likelihood of c...
117
click to vote
SWAT
1994
Springer
15 years 6 months ago
1994
Springer
Abstract. Finding maximum independent sets in graphs with bounded maximum degree is a well-studied NP-complete problem. We introduce an algorithm schema for improving the approxim...
113
click to vote
LPNMR
1997
Springer
15 years 6 months ago
1997
Springer
We present a bottom-up algorithm for the computation of the well-founded model of non-disjunctive logic programs which is based on the set of elementary program transformations stu...
110
click to vote
NIPS
2008
15 years 3 months ago
2008
We consider the problem of obtaining the approximate maximum a posteriori estimate of a discrete random field characterized by pairwise potentials that form a truncated convex mod...
117
click to vote
IWANN
2005
Springer
15 years 7 months ago
2005
Springer
Abstract. The authors propose a new solution to the blind robust watermarking of digital images. In this approach we embed the watermark into the independent components of the imag...