Sciweavers

299 search results - page 32 / 60
» A Convex Relaxation Approach for Computing Minimal Partition...
Sort
View
ISPD
2003
ACM
89views Hardware» more  ISPD 2003»
15 years 3 months ago
Local unidirectional bias for smooth cutsize-delay tradeoff in performance-driven bipartitioning
Traditional multilevel partitioning approaches have shown good performance with respect to cutsize, but offer no guarantees with respect to system performance. Timing-driven part...
Andrew B. Kahng, Xu Xu
DATE
2002
IEEE
82views Hardware» more  DATE 2002»
15 years 2 months ago
Dynamic Scheduling and Clustering in Symbolic Image Computation
The core computation in BDD-based symbolic synthesis and verification is forming the image and pre-image of sets of states under the transition relation characterizing the sequen...
Gianpiero Cabodi, Paolo Camurati, Stefano Quer
IPPS
2007
IEEE
15 years 4 months ago
A global address space framework for locality aware scheduling of block-sparse computations
In this paper, we present a mechanism for automatic management of the memory hierarchy, including secondary storage, in the context of a global address space parallel programming ...
Sriram Krishnamoorthy, Ümit V. Çataly&...
CVPR
2009
IEEE
16 years 4 months ago
Continuous Maximal Flows and Wulff Shapes: Application to MRFs
Convex and continuous energy formulations for low level vision problems enable efficient search procedures for the corresponding globally optimal solutions. In this work we exte...
Christopher Zach (UNC Chapel Hill), Marc Niethamme...
CORR
2008
Springer
124views Education» more  CORR 2008»
14 years 9 months ago
Scheduling Kalman Filters in Continuous Time
A set of N independent Gaussian linear time invariant systems is observed by M sensors whose task is to provide the best possible steady-state causal minimum mean square estimate o...
Jerome Le Ny, Eric Feron, Munther A. Dahleh