Sciweavers

1596 search results - page 112 / 320
» Human-Guided Simple Search
Sort
View
CISS
2008
IEEE
15 years 11 months ago
Costas array generator polynomials in finite fields
—Permutations of order N are generated using polynomials in a Galois field GF(q) where q > N+1, which can be written as a linear transformation on a vector of polynomial coeff...
James K. Beard
129
Voted
BIBE
2006
IEEE
15 years 11 months ago
Extending Pattern Branching to Handle Challenging Instances
We consider the planted motif search problem, a problem that arises from the need to find transcription factor-binding sites in genomic information. One of the fastest non-exact a...
Jaime Davila, Sanguthevar Rajasekaran
CRV
2006
IEEE
114views Robotics» more  CRV 2006»
15 years 11 months ago
Generic Detection of Multi-Part Objects by High-Level Analysis
A method is proposed to detect multi-part man-made or natural objects in complex images. It consists in first extracting simple curves and straight lines from the edge map. Then,...
Jean-Francois Bernier, Robert Bergevin
GECCO
2004
Springer
15 years 10 months ago
A Polynomial Upper Bound for a Mutation-Based Algorithm on the Two-Dimensional Ising Model
Abstract. Fitness functions based on the Ising model are suited excellently for studying the adaption capabilities of randomised search heuristics. The one-dimensional Ising model ...
Simon Fischer
171
Voted
PPSN
2004
Springer
15 years 10 months ago
A Primer on the Evolution of Equivalence Classes of Bayesian-Network Structures
Bayesian networks (BN) constitute a useful tool to model the joint distribution of a set of random variables of interest. To deal with the problem of learning sensible BN models fr...
Jorge Muruzábal, Carlos Cotta