Sciweavers

7015 search results - page 163 / 1403
» Approximation algorithms for co-clustering
Sort
View
SODA
1992
ACM
179views Algorithms» more  SODA 1992»
13 years 10 months ago
Approximating the Minimum Weight Triangulation
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
David Eppstein
JAT
2007
84views more  JAT 2007»
13 years 9 months ago
On Lebesgue-type inequalities for greedy approximation
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
ISCA
2011
IEEE
273views Hardware» more  ISCA 2011»
13 years 1 months ago
Bypass and insertion algorithms for exclusive last-level caches
Inclusive last-level caches (LLCs) waste precious silicon estate due to cross-level replication of cache blocks. As the industry moves toward cache hierarchies with larger inner l...
Jayesh Gaur, Mainak Chaudhuri, Sreenivas Subramone...
PPOPP
2011
ACM
13 years 14 days ago
Compact data structure and scalable algorithms for the sparse grid technique
The sparse grid discretization technique enables a compressed representation of higher-dimensional functions. In its original form, it relies heavily on recursion and complex data...
Alin Florindor Murarasu, Josef Weidendorfer, Gerri...
COCO
2009
Springer
106views Algorithms» more  COCO 2009»
14 years 4 months ago
Every Permutation CSP of arity 3 is Approximation Resistant
Moses Charikar, Venkatesan Guruswami, Rajsekar Man...