Sciweavers

244 search results - page 8 / 49
» A Linear Search Strategy using Bounds
Sort
View
ICPR
2008
IEEE
14 years 3 months ago
Constrained piecewise linear approximation of digital curves
We have considered a problem of continuous piecewise linear approximation of the digital curves with a minimum number of the line segments. Fast suboptimal algorithm for constrain...
Alexander Kolesnikov
JAIR
2011
123views more  JAIR 2011»
13 years 3 months ago
The Complexity of Integer Bound Propagation
Bound propagation is an important Artificial Intelligence technique used in Constraint Programming tools to deal with numerical constraints. It is typically embedded within a sea...
Lucas Bordeaux, George Katsirelos, Nina Narodytska...
CEC
2005
IEEE
14 years 2 months ago
Linear genetic programming using a compressed genotype representation
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
Johan Parent, Ann Nowé, Kris Steenhaut, Ann...
ICASSP
2010
IEEE
13 years 7 months ago
An alternative scanning strategy to detect faces
The sliding window approach is the most widely used technique to detect faces in an image. Usually a classifier is applied on a regular grid and to speed up the scanning, the gri...
Venkatesh Bala Subburaman, Sébastien Marcel
CSCLP
2005
Springer
14 years 2 months ago
A CSP Search Algorithm with Reduced Branching Factor
This paper presents an attempt to construct a ”practical” CSP algorithm that assigns a variable with 2 values at every step. Such a strategy has been successfully used for cons...
Igor Razgon, Amnon Meisels