519 search results - page 52 / 104 » A New Approach to Strongly Polynomial Linear Programming |
102
click to vote
ICPR
2008
IEEE
16 years 2 months ago
2008
IEEE
We propose a feature selection method that constructs each new feature by analysis of tight error clusters. This is a greedy, time-efficient forward selection algorithm that itera...
104
click to vote
DAC
2000
ACM
16 years 2 months ago
2000
ACM
We propose practical iterated methods for layout density control for CMP uniformity, based on linear programming, Monte-Carlo and greedy algorithms. We experimentally study the tr...
150
click to vote
UPP
2004
Springer
15 years 6 months ago
2004
Springer
Abstract. Achieving real-time response to complex, ambiguous, highbandwidth data is impractical with conventional programming. Only the narrow class of compressible input-output ma...
125
click to vote
TVLSI
2008
15 years 1 months ago
2008
Abstract--Technology scaling in the nanometer era has increased the transistor's susceptibility to process variations. The effects of such variations are having a huge impact ...
ICASSP
2009
IEEE
15 years 5 months ago
2009
IEEE
With the widespread popularity of digital images and the presence of easy-to-use image editing software, content integrity can no longer be taken for granted, and there is a stron...