Sciweavers

890 search results - page 109 / 178
» An Experimental Comparison of Stereo Algorithms
Sort
View
AAAI
1998
15 years 7 months ago
On the Conversion between Non-Binary and Binary Constraint Satisfaction Problems
It is well known that any non-binary discrete constraint satisfaction problem (CSP) can be translated into an equivalent binary CSP. Two translations are known: the dual graph tra...
Fahiem Bacchus, Peter van Beek
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
15 years 7 months ago
Behavior-based speciation for evolutionary robotics
This paper describes a speciation method that allows an evolutionary process to learn several robot behaviors using a single execution. Species are created in behavioral space in ...
Leonardo Trujillo, Gustavo Olague, Evelyne Lutton,...
INFORMATICALT
2008
139views more  INFORMATICALT 2008»
15 years 6 months ago
Fingerprint Minutiae Matching without Global Alignment Using Local Structures
This paper presents a method of minutiae based fingerprint matching that is robust to deformations and does not do fingerprint alignment. It concentrates on comparing rotation and ...
Andrej Kisel, Alexej Kochetkov, Justas Kranauskas
IVC
2006
87views more  IVC 2006»
15 years 6 months ago
On the relation between Memon's and the modified Zeng's palette reordering methods
Palette reordering has been shown to be a very effective approach for improving the compression of color-indexed images by general purpose continuous-tone image coding techniques....
Armando J. Pinho, António J. R. Neves
LISP
2008
104views more  LISP 2008»
15 years 6 months ago
Flattening tuples in an SSA intermediate representation
For functional programs, unboxing aggregate data structures such as tuples removes memory indirections and frees dead components of the decoupled structures. To explore the consequ...
Lukasz Ziarek, Stephen Weeks, Suresh Jagannathan