Sciweavers

1550 search results - page 243 / 310
» Optimizing search by showing results in context
Sort
View
CVIU
2008
180views more  CVIU 2008»
15 years 6 months ago
Topology cuts: A novel min-cut/max-flow algorithm for topology preserving segmentation in N-D images
Topology is an important prior in many image segmentation tasks. In this paper, we design and implement a novel graph-based min-cut/max-flow algorithm that incorporates topology p...
Yun Zeng, Dimitris Samaras, Wei Chen, Qunsheng Pen...
HEURISTICS
2006
120views more  HEURISTICS 2006»
15 years 6 months ago
A study of ACO capabilities for solving the maximum clique problem
This paper investigates the capabilities of the Ant Colony Optimization (ACO) meta-heuristic for solving the maximum clique problem, the goal of which is to find a largest set of ...
Christine Solnon, Serge Fenet
TKDE
2002
239views more  TKDE 2002»
15 years 5 months ago
An Efficient Path Computation Model for Hierarchically Structured Topographical Road Maps
In this paper, we have developed a HiTi (Hierarchical MulTi) graph model for structuring large topographical road maps to the minimum cost route computation. The HiTi graph model p...
Sungwon Jung, Sakti Pramanik
ICRA
2010
IEEE
142views Robotics» more  ICRA 2010»
15 years 4 months ago
Learning and planning high-dimensional physical trajectories via structured Lagrangians
— We consider the problem of finding sufficiently simple models of high-dimensional physical systems that are consistent with observed trajectories, and using these models to s...
Paul Vernaza, Daniel D. Lee, Seung-Joon Yi
TIT
2010
130views Education» more  TIT 2010»
15 years 27 days ago
The power of convex relaxation: near-optimal matrix completion
This paper is concerned with the problem of recovering an unknown matrix from a small fraction of its entries. This is known as the matrix completion problem, and comes up in a gr...
Emmanuel J. Candès, Terence Tao