2168 search results - page 72 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
160
Voted
AI
2011
Springer
14 years 10 months ago
2011
Springer
In this paper we propose a novel approach to decentralised coordination, that is able to efficiently compute solutions with a guaranteed approximation ratio. Our approach is base...
113
Voted
IEEEPACT
2006
IEEE
15 years 9 months ago
2006
IEEE
Modern out-of-order processors with non-blocking caches exploit Memory-Level Parallelism (MLP) by overlapping cache misses in a wide instruction window. The exploitation of MLP, h...
129
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
Rate-distortion (RD) optimized intra-prediction mode selection can lead to significant improvement in coding efficiency in intraframe encoding. However, it would incur considerabl...
148
Voted
PODS
2008
ACM
16 years 3 months ago
2008
ACM
We study complexity and approximation of queries in an expressive query language for probabilistic databases. The language studied supports the compositional use of confidence com...
154
Voted
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...