5506 search results - page 584 / 1102 » Minimal Logic Programs |
162
click to vote
ICIP
2009
IEEE
16 years 8 months ago
2009
IEEE
In this paper, following the Compressed Sensing (CS) paradigm, we study the problem of recovering sparse or compressible signals from uniformly quantized measurements. We present ...
176
click to vote
DAC
2000
ACM
16 years 8 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...
192
click to vote
ICCD
2008
IEEE
16 years 3 months ago
2008
IEEE
- In this paper, we analyze the impact of network contention on the application mapping for tile-based Networkon-Chip (NoC) architectures. Our main theoretical contribution consist...
176
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
162
click to vote
JVCIR
2007
15 years 6 months ago
2007
This paper qualitatively compares three recently proposed models for signal/image texture extraction based on total variation minimization: the Meyer [27], Vese–Osher (VO) [35],...