Sciweavers

3946 search results - page 669 / 790
» The computational complexity of choice sets
Sort
View
GECCO
2007
Springer
158views Optimization» more  GECCO 2007»
15 years 10 months ago
A GP neutral function for the artificial ANT problem
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
Esteban Ricalde, Katya Rodríguez-Váz...
3DPVT
2004
IEEE
136views Visualization» more  3DPVT 2004»
15 years 10 months ago
A Unified Representation for Interactive 3D Modeling
Interactive 3D modeling is the process of building a 3D model of an object or a scene in real-time while the 3D (range) data is acquired. This is possible only if the computationa...
Dragan Tubic, Patrick Hébert, Jean-Daniel D...
ATVA
2004
Springer
138views Hardware» more  ATVA 2004»
15 years 10 months ago
Providing Automated Verification in HOL Using MDGs
While model checking suffers from the state space explosion problem, theorem proving is quite tedious and impractical for verifying complex designs. In this work, we present a veri...
Tarek Mhamdi, Sofiène Tahar
FGR
2004
IEEE
161views Biometrics» more  FGR 2004»
15 years 10 months ago
AdaBoost with Totally Corrective Updates for Fast Face Detection
An extension of the AdaBoost learning algorithm is proposed and brought to bear on the face detection problem. In each weak classifier selection cycle, the novel totally correctiv...
Jan Sochman, Jiri Matas
CP
2006
Springer
15 years 10 months ago
Interactive Distributed Configuration
Interactive configuration is the concept of assisting a user in selecting values for parameters that respect given constraints. It was originally inspired by the product configurat...
Peter Tiedemann, Tarik Hadzic, Thomas Stuart Henne...