Sciweavers

1760 search results - page 34 / 352
» Connected Set Cover Problem and Its Applications
Sort
View
IWPEC
2009
Springer
14 years 2 months ago
What Makes Equitable Connected Partition Easy
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
Rosa Enciso, Michael R. Fellows, Jiong Guo, Iyad A...
CVPR
2008
IEEE
14 years 9 months ago
Auto-context and its application to high-level vision tasks
The notion of using context information for solving highlevel vision problems has been increasingly realized in the field. However, how to learn an effective and efficient context...
Zhuowen Tu
PAMI
2010
417views more  PAMI 2010»
13 years 6 months ago
Auto-Context and Its Application to High-Level Vision Tasks and 3D Brain Image Segmentation
The notion of using context information for solving high-level vision and medical image segmentation problems has been increasingly realized in the field. However, how to learn a...
Zhuowen Tu, Xiang Bai
DAC
2009
ACM
14 years 2 months ago
Clock skew optimization via wiresizing for timing sign-off covering all process corners
Manufacturing process variability impacts the performance of synchronous logic circuits by means of its effect on both clock network and functional block delays. Typically, varia...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
IPCO
2004
144views Optimization» more  IPCO 2004»
13 years 9 months ago
Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
Abstract. We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our pr...
R. Ravi, Amitabh Sinha