708 search results - page 76 / 142 » Timing closure: the solution and its problems |
BILDMED
2007
14 years 11 months ago
2007
Abstract. In the last decades there has been tremendous research towards the design of fully automatic non-rigid registration schemes. However, apart from the ITK based implementat...
108
click to vote
SIAMIS
2010
14 years 4 months ago
2010
This paper analyzes and improves the linearized Bregman method for solving the basis pursuit and related sparse optimization problems. The analysis shows that the linearized Bregma...
VLDB
1998
ACM
15 years 2 months ago
1998
ACM
To fulfill the requirement of fast interactive multidimensional data analysis, database systems precompute aggregate views on some subsets of dimensions and their corresponding hi...
113
click to vote
VLSID
2009
IEEE
15 years 10 months ago
2009
IEEE
Many system-level design tasks (e.g. timing analysis, hardware/software partitioning and design space exploration) involve computational kernels that are intractable (usually NP-ha...
SIGECOM
2009
ACM
15 years 4 months ago
2009
ACM
The Target Set Selection problem proposed by Kempe, Kleinberg, and Tardos, gives a nice clean combinatorial formulation for many problems arising in economy, sociology, and medicin...