Sciweavers

3142 search results - page 483 / 629
» Solving Hierarchical Optimization Problems Using MOEAs
Sort
View
CVPR
2011
IEEE
13 years 6 months ago
A Closed Form Solution to Robust Subspace Estimation and Clustering
We consider the problem of fitting one or more subspaces to a collection of data points drawn from the subspaces and corrupted by noise/outliers. We pose this problem as a rank m...
Paolo Favaro, René, Vidal, Avinash Ravichandran

Publication
362views
15 years 10 months ago
A Bayesian Incentive Compatible Mechanism for Decentralized Supply Chain Formation
In this paper, we consider a decentralized supply chain formation problem for linear, multi-echelon supply chains when the managers of the individual echelons are autonomous, ratio...
Y. Narahari and Nikesh Kumar Srivastava
ICPR
2006
IEEE
14 years 12 months ago
A Texture Based Matching Approach for Automated Assembly of Puzzles
The puzzle assembly problem has many application areas such as restoration and reconstruction of archeological findings, repairing of broken objects, solving jigsaw type puzzles, ...
Mahmut Samil Sagiroglu, Aytül Erçil
CVPR
2010
IEEE
14 years 7 months ago
Discriminative Clustering for Image Co-segmentation
Purely bottom-up, unsupervised segmentation of a single image into two segments remains a challenging task for computer vision. The co-segmentation problem is the process of joi...
Armand Joulin, Francis Bach, Jean Ponce
EVOW
2006
Springer
14 years 2 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...