416 search results - page 40 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
117
Voted
ICCAD
2001
IEEE
16 years 5 days ago
2001
IEEE
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
121
click to vote
ICML
2009
IEEE
15 years 10 months ago
2009
IEEE
We consider the problem of selecting a subset of m most informative features where m is the number of required features. This feature selection problem is essentially a combinator...
140
Voted
ICALP
2009
Springer
16 years 3 months ago
2009
Springer
Traditionally, combinatorial optimization problems (such as maximum flow, maximum matching, etc.) have been studied for networks where each link has a fixed capacity. Recent resear...
114
click to vote
DGCI
2005
Springer
15 years 8 months ago
2005
Springer
Abstract. We give an overview of the main ideas and tools that have been employed in uncertain geometry. We show how several recognition problems in computer vision can be translat...
109
click to vote
ISPD
1997
ACM
15 years 7 months ago
1997
ACM
— In this paper, we consider the thermal placement problem for gate arrays. We introduce a new combinatorial optimization problem, matrix synthesis problem (MSP), to model the th...