2924 search results - page 149 / 585 » Lower Bounds in Distributed Computing |
100
click to vote
DATE
2003
IEEE
15 years 6 months ago
2003
IEEE
The growing impact of within-die process variation has created the need for statistical timing analysis, where gate delays are modeled as random variables. Statistical timing anal...
117
click to vote
CVPR
2000
IEEE
16 years 2 months ago
2000
IEEE
While several image-based rendering techniques have been proposed to successfully render scenes/objects from a large collection (e.g., thousands) of images without explicitly reco...
85
Voted
COCO
2009
Springer
15 years 7 months ago
2009
Springer
Devising an efficient deterministic – or even a nondeterministic sub-exponential time – algorithm for testing polynomial identities is a fundamental problem in algebraic comp...
112
click to vote
ISPD
2004
ACM
15 years 6 months ago
2004
ACM
VLSI placement tools usually work in two steps: First, the cells that have to be placed are roughly spread out over the chip area ignoring disjointness (global placement). Then, i...
104
Voted
COMPGEOM
2010
ACM
15 years 5 months ago
2010
ACM
Let B be a collection of n arbitrary balls in R3 . We establish an almost-tight upper bound of O(n3+ε ), for any ε > 0, on the complexity of the space F(B) of all the lines t...