Sciweavers

2157 search results - page 280 / 432
» Binary ant algorithm
Sort
View
EVOW
2009
Springer
15 years 10 months ago
Finding Balanced Incomplete Block Designs with Metaheuristics
This paper deals with the generation of balanced incomplete block designs (BIBD), a hard constrained combinatorial problem with multiple applications. This problem is here formulat...
David Rodríguez Rueda, Carlos Cotta, Antoni...
CALC
2001
Springer
145views Cryptology» more  CALC 2001»
15 years 10 months ago
Fast Reduction of Ternary Quadratic Forms
We show that a positive definite integral ternary form can be reduced with O(M(s) log2 s) bit operations, where s is the binary encoding length of the form and M(s) is the bit-com...
Friedrich Eisenbrand, Günter Rote
COCO
2001
Springer
142views Algorithms» more  COCO 2001»
15 years 10 months ago
On the Complexity of Approximating the VC Dimension
We study the complexity of approximating the VC dimension of a collection of sets, when the sets are encoded succinctly by a small circuit. We show that this problem is • Σp 3-...
Elchanan Mossel, Christopher Umans
ICPR
2000
IEEE
15 years 10 months ago
Knowledge Based Fingerprint Image Enhancement
Fingerprint enhancement is a critical step in fingerprint identification. Most of the existing enhancement algorithms are based on local ridge direction. The main drawback of thes...
Xiping Luo, Jie Tian
177
Voted
EMMCVPR
1999
Springer
15 years 10 months ago
Auxiliary Variables for Markov Random Fields with Higher Order Interactions
Markov Random Fields are widely used in many image processing applications. Recently the shortcomings of some of the simpler forms of these models have become apparent, and models ...
Robin D. Morris