614 search results - page 50 / 123 » Local Computation: Lower and Upper Bounds |
FOCS
2005
IEEE
15 years 3 months ago
2005
IEEE
We consider online problems where purchases have time durations which expire regardless of whether the purchase is used or not. The Parking Permit Problem is the natural analog of...
100
click to vote
GC
2008
Springer
14 years 10 months ago
2008
Springer
An acyclic coloring of a graph G is a proper coloring of the vertex set of G such that G contains no bichromatic cycles. The acyclic chromatic number of a graph G is the minimum nu...
105
click to vote
DAC
2004
ACM
15 years 11 months ago
2004
ACM
CT An efficient statistical timing analysis algorithm that can handle arbitrary (spatial and structural) causes of delay correlation is described. The algorithm derives the entire ...
ISCA
1992
IEEE
15 years 2 months ago
1992
IEEE
As multiprocessor sizes scale and computer architects turn to interconnection networks with non-uniform communication latencies, the lure of exploiting communication locality to i...
100
click to vote
ECCV
2008
Springer
15 years 12 months ago
2008
Springer
Abstract. We address the problem of estimating human body pose from a single image with cluttered background. We train multiple local linear regressors for estimating the 3D pose f...