Sciweavers

1299 search results - page 26 / 260
» Computing Minimal Diagnoses with Critical Set Algorithms
Sort
View
JCO
2011
115views more  JCO 2011»
14 years 9 months ago
Approximation scheme for restricted discrete gate sizing targeting delay minimization
Discrete gate sizing is a critical optimization in VLSI circuit design. Given a set of available gate sizes, discrete gate sizing problem asks to assign a size to each gate such th...
Chen Liao, Shiyan Hu
ICALP
2004
Springer
15 years 7 months ago
The Minimum-Entropy Set Cover Problem
We study graph orientations that minimize the entropy of the in-degree sequence. The problem of finding such an orientation is an interesting special case of the minimum entropy ...
Eran Halperin, Richard M. Karp
COMPUTING
2010
14 years 11 months ago
Minimization of SONET ADMs in ring networks revisited
We design improved approximation algorithms for two variants of the ADM minimization problem. SONET add-drop multiplexers (ADMs) are the dominant cost factor in SONET/WDM rings. T...
Leah Epstein, Asaf Levin, Betzalel Menahem
ECCV
2010
Springer
15 years 7 months ago
Energy Minimization Under Constraints on Label Counts
Abstract. Many computer vision problems such as object segmentation or reconstruction can be formulated in terms of labeling a set of pixels or voxels. In certain scenarios, we may...
CVPR
2008
IEEE
16 years 4 months ago
Minimal solutions for generic imaging models
A generic imaging model refers to a non-parametric camera model where every camera is treated as a set of unconstrained projection rays. Calibration would simply be a method to ma...
Srikumar Ramalingam, Peter F. Sturm