Sciweavers

16404 search results - page 724 / 3281
» A set coverage problem
Sort
View
ICCAD
1996
IEEE
80views Hardware» more  ICCAD 1996»
15 years 11 months ago
Generalized constraint generation in the presence of non-deterministic parasitics
In a constraint-drivenlayout synthesisenvironment,parasitic constraints are generated and implemented in each phase of the design process to meet a given set of performance specif...
Edoardo Charbon, Paolo Miliozzi, Enrico Malavasi, ...
199
Voted
CIAC
2006
Springer
135views Algorithms» more  CIAC 2006»
15 years 11 months ago
Approximation Algorithms for Capacitated Rectangle Stabbing
In the rectangle stabbing problem we are given a set of axis parallel rectangles and a set of horizontal and vertical lines, and our goal is to find a minimum size subset of lines...
Guy Even, Dror Rawitz, Shimon Shahar
178
Voted
CP
2006
Springer
15 years 11 months ago
Global Optimization of Probabilistically Constrained Linear Programs
We consider probabilistic constrained linear programs with general distributions for the uncertain parameters. These problems generally involve non-convex feasible sets. We develo...
Shabbir Ahmed
NIPS
2007
15 years 8 months ago
A Spectral Regularization Framework for Multi-Task Structure Learning
Learning the common structure shared by a set of supervised tasks is an important practical and theoretical problem. Knowledge of this structure may lead to better generalization ...
Andreas Argyriou, Charles A. Micchelli, Massimilia...
195
Voted
CCCG
1998
15 years 8 months ago
Quantile approximation for robust statistical estimation
Given a set P of n points in Rd, a fundamental problem in computational geometry is concerned with finding the smallest shape of some type that encloses all the points of P. Well-...
David M. Mount, Nathan S. Netanyahu, Christine D. ...