Sciweavers

358 search results - page 28 / 72
» On the Distributed Complexity of Computing Maximal Matchings
Sort
View
ICCAD
1997
IEEE
90views Hardware» more  ICCAD 1997»
15 years 8 months ago
A hierarchical decomposition methodology for multistage clock circuits
† This paper describes a novel methodology to automate the design of the interconnect distribution for multistage clock circuits. We introduce two key ideas. First, a hierarchica...
Gary Ellis, Lawrence T. Pileggi, Rob A. Rutenbar
ICCV
2009
IEEE
1234views Computer Vision» more  ICCV 2009»
16 years 9 months ago
Human Pose Estimation Using Consistent Max-Covering
We propose a novel consistent max-covering scheme for human pose estimation. Consistent max-covering formulates pose estimation as the covering of body part polygons on an objec...
Hao Jiang
SIGCOMM
2004
ACM
15 years 9 months ago
Work-conserving distributed schedulers for Terabit routers
−Buffered multistage interconnection networks offer one of the most scalable and cost-effective approaches to building high capacity routers. Unfortunately, the performance of su...
Prashanth Pappu, Jonathan S. Turner, Kenneth Wong
ECCC
2007
69views more  ECCC 2007»
15 years 4 months ago
Testing Symmetric Properties of Distributions
We introduce the notion of a Canonical Tester for a class of properties on distributions, that is, a tester strong and general enough that “a distribution property in the class ...
Paul Valiant
122
Voted
IPPS
2000
IEEE
15 years 8 months ago
On Optimal Fill-Preserving Orderings of Sparse Matrices for Parallel Cholesky Factorizations
In this paper, we consider the problem of nding llpreserving ordering of a sparse symmetric and positive de nite matrix such that the reordered matrix is suitable for parallel fac...
Wen-Yang Lin, Chuen-Liang Chen