Sciweavers

44 search results - page 4 / 9
» soda 2012
Sort
View
SODA
2012
ACM
223views Algorithms» more  SODA 2012»
11 years 8 months ago
Data reduction for weighted and outlier-resistant clustering
Statistical data frequently includes outliers; these can distort the results of estimation procedures and optimization problems. For this reason, loss functions which deemphasize ...
Dan Feldman, Leonard J. Schulman
SODA
2012
ACM
227views Algorithms» more  SODA 2012»
11 years 8 months ago
Improved output-sensitive quantum algorithms for Boolean matrix multiplication
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
François Le Gall
SODA
2012
ACM
205views Algorithms» more  SODA 2012»
11 years 8 months ago
Approximate duality of multicommodity multiroute flows and cuts: single source case
Given an integer h, a graph G = (V, E) with arbitrary positive edge capacities and k pairs of vertices (s1, t1), (s2, t2), . . . , (sk, tk), called terminals, an h-route cut is a ...
Petr Kolman, Christian Scheideler
SODA
2012
ACM
195views Algorithms» more  SODA 2012»
11 years 8 months ago
Concentration and moment inequalities for polynomials of independent random variables
In this work we design a general method for proving moment inequalities for polynomials of independent random variables. Our method works for a wide range of random variables incl...
Warren Schudy, Maxim Sviridenko
SODA
2012
ACM
217views Algorithms» more  SODA 2012»
11 years 8 months ago
Deterministic construction of an approximate M-ellipsoid and its applications to derandomizing lattice algorithms
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
Daniel Dadush, Santosh Vempala