796 search results - page 20 / 160 » Approximating the centroid is hard |
151
click to vote
STOC
2009
ACM
16 years 6 months ago
2009
ACM
In this paper we study a fundamental open problem in the area of probabilistic checkable proofs: What is the smallest s such that NP naPCP1,s[O(log n), 3]? In the language of har...
150
click to vote
SODA
2010
ACM
15 years 4 months ago
2010
ACM
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
181
Voted
JCAM
2010
15 years 25 days ago
2010
A new approach to slope limiting for discontinuous Galerkin methods on arbitrary meshes is introduced. A local Taylor basis is employed to express the approximate solution in term...
160
click to vote
STOC
2006
ACM
15 years 12 months ago
2006
ACM
We show that for any constant ε > 0, there is no Ω(log1−ε M)approximation algorithm for the directed congestion minimization problem on networks of size M unless NP ⊆ Z...
152
click to vote
ICCV
2005
IEEE
15 years 11 months ago
2005
IEEE
We derive the clustering problem from first principles showing that the goal of achieving a probabilistic, or ”hard”, multi class clustering result is equivalent to the algeb...