Sciweavers

561 search results - page 79 / 113
» Algorithms and applications for approximate nonnegative matr...
Sort
View
FOCS
2009
IEEE
14 years 2 months ago
Symmetry and Approximability of Submodular Maximization Problems
Abstract— A number of recent results on optimization problems involving submodular functions have made use of the ”multilinear relaxation” of the problem [3], [8], [24], [14]...
Jan Vondrák
COCOA
2008
Springer
13 years 9 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
APPROX
2004
Springer
121views Algorithms» more  APPROX 2004»
14 years 1 months ago
Small Pseudo-random Families of Matrices: Derandomizing Approximate Quantum Encryption
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
Andris Ambainis, Adam Smith
ESA
2010
Springer
140views Algorithms» more  ESA 2010»
13 years 8 months ago
A Unified Approach to Approximate Proximity Searching
The inability to answer proximity queries efficiently for spaces of dimension d > 2 has led to the study of approximation to proximity problems. Several techniques have been pro...
Sunil Arya, Guilherme Dias da Fonseca, David M. Mo...
COCO
2010
Springer
144views Algorithms» more  COCO 2010»
13 years 11 months ago
A Regularity Lemma, and Low-Weight Approximators, for Low-Degree Polynomial Threshold Functions
We give a “regularity lemma” for degree-d polynomial threshold functions (PTFs) over the Boolean cube {−1, 1}n . Roughly speaking, this result shows that every degree-d PTF ...
Ilias Diakonikolas, Rocco A. Servedio, Li-Yang Tan...