Sciweavers

3946 search results - page 365 / 790
» The computational complexity of choice sets
Sort
View
GPEM
2008
98views more  GPEM 2008»
15 years 7 months ago
Sporadic model building for efficiency enhancement of the hierarchical BOA
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
Martin Pelikan, Kumara Sastry, David E. Goldberg
CVPR
2008
IEEE
16 years 9 months ago
Unsupervised modeling of object categories using link analysis techniques
We propose an approach for learning visual models of object categories in an unsupervised manner in which we first build a large-scale complex network which captures the interacti...
Gunhee Kim, Christos Faloutsos, Martial Hebert
ICCV
1998
IEEE
16 years 8 months ago
Shape Recovery Using Dynamic Subdivision Surfaces
A new dynamic subdivision surface model is proposed for shape recovery from 3D data sets. The model inherits the attractive properties of the Catmull-Clark subdivision scheme and ...
Chhandomay Mandal, Baba C. Vemuri, Hong Qin
ICIC
2009
Springer
16 years 1 months ago
Function Sequence Genetic Programming
Genetic Programming(GP) can obtain a program structure to solve complex problem. This paper presents a new form of Genetic Programming, Function Sequence Genetic Programming (FSGP)...
Shixian Wang, Yuehui Chen, Peng Wu
COCO
1999
Springer
101views Algorithms» more  COCO 1999»
15 years 11 months ago
A Lower Bound for Primality
Recent work by Bernasconi, Damm and Shparlinski showed that the set of square-free numbers is not in AC0 , and raised as an open question whether similar (or stronger) lower bound...
Eric Allender, Michael E. Saks, Igor Shparlinski