Sciweavers

2312 search results - page 344 / 463
» An algorithmic approach to knowledge evolution
Sort
View
COMPGEOM
2010
ACM
15 years 9 months ago
Manifold reconstruction using tangential Delaunay complexes
We give a provably correct algorithm to reconstruct a kdimensional manifold embedded in d-dimensional Euclidean space. Input to our algorithm is a point sample coming from an unkn...
Jean-Daniel Boissonnat, Arijit Ghosh
GECCO
2008
Springer
137views Optimization» more  GECCO 2008»
15 years 6 months ago
Informative sampling for large unbalanced data sets
Selective sampling is a form of active learning which can reduce the cost of training by only drawing informative data points into the training set. This selected training set is ...
Zhenyu Lu, Anand I. Rughani, Bruce I. Tranmer, Jos...
ICCV
2011
IEEE
14 years 5 months ago
N-best maximal decoders for part models
We describe a method for generating N-best configurations from part-based models, ensuring that they do not overlap according to some user-provided definition of overlap. We ext...
Dennis Park, Deva Ramanan
GECCO
2007
Springer
151views Optimization» more  GECCO 2007»
15 years 11 months ago
Solving real-valued optimisation problems using cartesian genetic programming
Classical Evolutionary Programming (CEP) and Fast Evolutionary Programming (FEP) have been applied to realvalued function optimisation. Both of these techniques directly evolve th...
James Alfred Walker, Julian Francis Miller
ICCV
2007
IEEE
16 years 7 months ago
Fast Crowd Segmentation Using Shape Indexing
This paper presents a fast, accurate, and novel method for the problem of estimating the number of humans and their positions from background differenced images obtained from a si...
Lan Dong, Vasu Parameswaran, Visvanathan Ramesh, I...