Sciweavers

2095 search results - page 312 / 419
» Improved pebbling bounds
Sort
View
ICDCS
2009
IEEE
14 years 7 months ago
A Note on Distributed Stable Matching
We consider the distributed complexity of the stable marriage problem. In this problem, the communication graph is undirected and bipartite, and each node ranks its neighbors. Giv...
Alex Kipnis, Boaz Patt-Shamir
ICCD
2005
IEEE
100views Hardware» more  ICCD 2005»
14 years 7 months ago
Temporal Decomposition for Logic Optimization
Traditional approaches for sequential logic optimization include (1) explicit state-based techniques such as state minimization, (2) structural techniques such as retiming, and (3...
Nathan Kitchen, Andreas Kuehlmann
ICCAD
2006
IEEE
95views Hardware» more  ICCAD 2006»
14 years 7 months ago
Robust estimation of parametric yield under limited descriptions of uncertainty
Reliable prediction of parametric yield for a specific design is difficult; a significant reason is the reliance of the yield estimation methods on the hard-to-measure distributio...
Wei-Shen Wang, Michael Orshansky
ICCAD
2005
IEEE
94views Hardware» more  ICCAD 2005»
14 years 7 months ago
Post-placement voltage island generation under performance requirement
High power consumption not only leads to short battery life for handheld devices, but also causes on-chip thermal and reliability problems in general. As power consumption is prop...
Huaizhi Wu, I-Min Liu, Martin D. F. Wong, Yusu Wan...
CVPR
2010
IEEE
14 years 6 months ago
Covering Trees and Lower-bounds on Quadratic Assignment
Many computer vision problems involving feature correspondence among images can be formulated as an assignment problem with a quadratic cost function. Such problems are computatio...
Julian Yarkony, Charless Fowlkes, Alex Ihler