5331 search results - page 360 / 1067 » Algebraic Methods for Optimization Problems |
191
click to vote
ICCAD
2009
IEEE
15 years 4 months ago
2009
IEEE
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
183
Voted
STOC
2004
ACM
16 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
236
Voted
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
Manually labeled landmark sets are often required as in-
puts for landmark-based image registration. Identifying an
optimal subset of landmarks from a training dataset may be
us...
169
click to vote
CP
2006
Springer
15 years 10 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
154
click to vote
SAIG
2000
Springer
15 years 10 months ago
2000
Springer
The phrase optimal program specialization" was de ned by Jones et al. in 1993 to capture the idea of a specializer being strong enough to remove entire layers of interpretatio...