Sciweavers

1816 search results - page 126 / 364
» A New Approach for Solving the Maximum Clique Problem
Sort
View
CVPR
2010
IEEE
15 years 8 months ago
A Study on Continuous Max-Flow and Min-Cut Approaches
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
Jing Yuan, Egil Bae, Xuecheng Tai
IROS
2006
IEEE
100views Robotics» more  IROS 2006»
16 years 8 days ago
Multi-Robot Motion Planning by Incremental Coordination
— A recent study showed that high failure rates in many instances of decoupled multi-robot motion planning makes the decoupled planning approach an unsuitable choice in compariso...
Mitul Saha, Pekka Isto
DATE
2003
IEEE
102views Hardware» more  DATE 2003»
15 years 11 months ago
Power Constrained High-Level Synthesis of Battery Powered Digital Systems
We present a high-level synthesis algorithm solving the combined scheduling, allocation and binding problem minimizing area under both latency and maximum power per clock-cycle co...
S. F. Nielsen, Jan Madsen
FDBS
2001
108views more  FDBS 2001»
15 years 7 months ago
Combining a Formal with an Example-driven Approach for Data Integration
Integrating data sources is a general problem in many scenarios. The main problem is the heterogeneity between data sources which were created and developed separately. In the lit...
Ingolf Geist, Kai-Uwe Sattler, Ingo Schmitt
SODA
2004
ACM
115views Algorithms» more  SODA 2004»
15 years 7 months ago
Minimizing the stabbing number of matchings, trees, and triangulations
The (axis-parallel) stabbing number of a given set of line segments is the maximum number of segments that can be intersected by any one (axis-parallel) line. We investigate probl...
Sándor P. Fekete, Marco E. Lübbecke, H...