Sciweavers

188 search results - page 20 / 38
» A System-Level Synthesis Algorithm with Guaranteed Solution ...
Sort
View
CVPR
2009
IEEE
15 years 2 months ago
Alphabet SOUP: A Framework for Approximate Energy Minimization
Many problems in computer vision can be modeled using conditional Markov random fields (CRF). Since finding the maximum a posteriori (MAP) solution in such models is NP-hard, mu...
Stephen Gould (Stanford University), Fernando Amat...
DAC
2009
ACM
14 years 8 months ago
A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion
As VLSI technology enters the nanoscale regime, interconnect delay has become the bottleneck of the circuit timing. As one of the most powerful techniques for interconnect optimiz...
Shiyan Hu, Zhuo Li, Charles J. Alpert
CODES
1999
IEEE
13 years 12 months ago
A hardware-software cosynthesis technique based on heterogeneous multiprocessor scheduling
In this paper, we propose a fast and simple heuristic for the cosynthesis problem targeting the system-on-chip (SOC) design. The proposed algorithm covers from implementation sele...
Hyunok Oh, Soonhoi Ha
ISQED
2006
IEEE
116views Hardware» more  ISQED 2006»
14 years 1 months ago
Probabilistic Delay Budgeting for Soft Realtime Applications
Unlike their hard realtime counterparts, soft realtime applications are only expected to guarantee their ”expected delay” over input data space. This paradigm shift calls for ...
Soheil Ghiasi, Po-Kuan Huang
KDD
2010
ACM
195views Data Mining» more  KDD 2010»
13 years 11 months ago
Universal multi-dimensional scaling
In this paper, we propose a unified algorithmic framework for solving many known variants of MDS. Our algorithm is a simple iterative scheme with guaranteed convergence, and is m...
Arvind Agarwal, Jeff M. Phillips, Suresh Venkatasu...