200 search results - page 5 / 40 » Submodular Optimization under Noise |
SODA
2010
ACM
14 years 6 months ago
2010
ACM
We consider a robust model proposed by Scarf, 1958, for stochastic optimization when only the marginal probabilities of (binary) random variables are given, and the correlation be...
ISPD
2006
ACM
14 years 2 months ago
2006
ACM
The existing decoupling capacitance optimization approaches meet constraints on input impedance for package. In this paper, we show that using impedance as constraints leads to la...
SODA
2008
ACM
13 years 10 months ago
2008
ACM
We present greedy algorithms for some classes of combinatorial packing and cover problems within the general formal framework of Hoffman and Schwartz' lattice polyhedra. Our ...
ECCV
2002
Springer
14 years 10 months ago
2002
Springer
Establishing point correspondences between images is a key step for 3D-shape computation. Nevertheless, shape extraction and point correspondence are treated, usually, as two diffe...
DAC
1998
ACM
14 years 17 days ago
1998
ACM
Interconnect-driven optimization is an increasingly important step in high-performance design. Algorithms for buffer insertion have been successfully utilized to reduce delay in gl...