Sciweavers

156 search results - page 16 / 32
» In Search of Optimal Codes for DNA Computing
Sort
View
ICC
2007
IEEE
15 years 3 months ago
Turbo Multiuser Detection Based on Local Search Algorithms
—The full-complexity soft-input/soft-output (SISO) multiuser detector based on the a posteriori probability (APP) algorithm has a computational complexity growing exponentially w...
Zhiliang Qin, Kui Cai, Xiaoxin Zou
ICCV
2009
IEEE
1735views Computer Vision» more  ICCV 2009»
16 years 2 months ago
Coded Aperture Pairs for Depth From Defocus
The classical approach to depth from defocus uses two images taken with circular apertures of different sizes. We show in this paper that the use of a circular aperture severely...
Changyin Zhou, Stephen Lin, Shree Nayar
GECCO
2008
Springer
148views Optimization» more  GECCO 2008»
14 years 10 months ago
Using quotient graphs to model neutrality in evolutionary search
We introduce quotient graphs for modeling neutrality in evolutionary search. We demonstrate that for a variety of evolutionary computing problems, search can be characterized by g...
Dominic Wilson, Devinder Kaur
ICIP
1998
IEEE
15 years 11 months ago
An Efficient Motion Estimation Algorithm based on Tracing Techniques on Large Search Windows
Motion estimation represents the most computationally intensive task for all efficient motion compensated compression standards. This fact, despite the several eflorts aiming at r...
Marco Mattavelli, Giorgio Zoia
GECCO
2009
Springer
133views Optimization» more  GECCO 2009»
15 years 2 months ago
Evolutionary codings and operators for the terminal assignment problem
Given a collection of terminals, each with a demand, a collection of concentrators, each with a capacity, and costs of connecting the terminals to the concentrators, the terminal ...
Bryant A. Julstrom