Sciweavers

530 search results - page 101 / 106
» A New Iterative Method for Solving Initial Value Problems
Sort
View
GECCO
2003
Springer
132views Optimization» more  GECCO 2003»
14 years 20 days ago
Circuit Bipartitioning Using Genetic Algorithm
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
Jong-Pil Kim, Byung Ro Moon
CVPR
2003
IEEE
14 years 9 months ago
Shape-From-Silhouette of Articulated Objects and its Use for Human Body Kinematics Estimation and Motion Capture
Shape-From-Silhouette (SFS), also known as Visual Hull (VH) construction, is a popular 3D reconstruction method which estimates the shape of an object from multiple silhouette ima...
German K. M. Cheung, Simon Baker, Takeo Kanade
GECCO
2010
Springer
158views Optimization» more  GECCO 2010»
13 years 10 months ago
Efficiently evolving programs through the search for novelty
A significant challenge in genetic programming is premature convergence to local optima, which often prevents evolution from solving problems. This paper introduces to genetic pro...
Joel Lehman, Kenneth O. Stanley
ECCV
2002
Springer
14 years 9 months ago
Multi-scale EM-ICP: A Fast and Robust Approach for Surface Registration
We investigate in this article the rigid registration of large sets of points, generally sampled from surfaces. We formulate this problem as a general Maximum-Likelihood (ML) estim...
Sébastien Granger, Xavier Pennec
SIAMMAX
2010
164views more  SIAMMAX 2010»
13 years 2 months ago
Uniqueness of Low-Rank Matrix Completion by Rigidity Theory
The problem of completing a low-rank matrix from a subset of its entries is often encountered in the analysis of incomplete data sets exhibiting an underlying factor model with app...
Amit Singer, Mihai Cucuringu