Sciweavers

841 search results - page 68 / 169
» Approximability of Minimum AND-Circuits
Sort
View
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
14 years 7 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
PDCAT
2005
Springer
14 years 3 months ago
Approximating Spanning Trees with Inner Nodes Cost
We consider the practical NP-complete problem of finding a minimum weight spanning tree with both edge weights and inner nodes weights. We present two polynomial time algorithms ...
Rudolf Fleischer, Qi Ge, Jian Li, Shijun Tian, Hai...
HUMO
2007
Springer
14 years 4 months ago
3D Hand Tracking in a Stochastic Approximation Setting
Abstract. This paper introduces a hand tracking system with a theoretical proof of convergence. The tracking system follows a model-based approach and uses image-based cues, namely...
Desmond Chik, Jochen Trumpf, Nicol N. Schraudolph
WADS
2009
Springer
274views Algorithms» more  WADS 2009»
14 years 4 months ago
Approximating Transitive Reductions for Directed Networks
Abstract. We consider minimum equivalent digraph problem, its maximum optimization variant and some non-trivial extensions of these two types of problems motivated by biological an...
Piotr Berman, Bhaskar DasGupta, Marek Karpinski
ICASSP
2008
IEEE
14 years 4 months ago
Approximate lower bounds for rate-distortion in compressive sensing systems
We attempt to quantify the possible gains that can be achieved by examining a rate-distortion competition between a conventional and a compressive sampling solution to data rate r...
Bernard Mulgrew, Michael E. Davies