Export Citations
2 Results for: Book/Issue: STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computing
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
Searched The ACM Guide to Computing Literature (3,848,854 records)|Limit your search to The ACM Full-Text Collection (776,749 records)
Showing 1 - 2of2 Results
Select All
- research-articleJune 2011
A unified framework for approximating and clustering data
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computingPages 569–578https://doi.org/10.1145/1993636.1993712Given a set F of n positive functions over a ground set X, we consider the problem of computing x* that minimizes the expression ∑f ∈ Ff(x), over x ∈ X. A typical application is shape fitting, where we wish to approximate a set P of n elements (say, ...
- research-articleJune 2011
An LLL-reduction algorithm with quasi-linear time complexity: extended abstract
STOC '11: Proceedings of the forty-third annual ACM symposium on Theory of computingPages 403–412https://doi.org/10.1145/1993636.1993691We devise an algorithm, L1, with the following specifications: It takes as input an arbitrary basis B=(bi)i ∈ Zd x d of a Euclidean lattice L; It computes a basis of L which is reduced for a mild modification of the Lenstra-Lenstra-Lovász reduction; It ...
