156 search results - page 29 / 32 » In Search of Optimal Codes for DNA Computing |
100
click to vote
CGO
2011
IEEE
14 years 1 months ago
2011
IEEE
—Approximating ideal program outputs is a common technique for solving computationally difficult problems, for adhering to processing or timing constraints, and for performance ...
129
click to vote
WAPCV
2007
Springer
15 years 3 months ago
2007
Springer
The innovation of this work is the provision of a system that learns visual encodings of attention patterns and that enables sequential attention for object detection in real world...
120
click to vote
CVPR
2012
IEEE
12 years 12 months ago
2012
IEEE
Recent years have witnessed the growing popularity of hashing in large-scale vision problems. It has been shown that the hashing quality could be boosted by leveraging supervised ...
GECCO
2005
Springer
15 years 2 months ago
2005
Springer
We introduce a clustering-based method of subpopulation management in genetic programming (GP) called Evolutionary Tree Genetic Programming (ETGP). The biological motivation behin...
86
Voted
AVBPA
1997
Springer
15 years 1 months ago
1997
Springer
In this paper we describe a system to reliably localize the position of the speaker’s face and mouth in videophone sequences. A statistical scheme based on a subspace method is p...