Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
11 years 3 months ago
Differentially Private Combinatorial Optimization
Consider the following problem: given a metric space, some of whose points are "clients," select a set of at most k facility locations to minimize the average distance f...
Anupam Gupta, Katrina Ligett, Frank McSherry, Aaro...
SODA
2010
ACM
171views Algorithms» more  SODA 2010»
11 years 3 months ago
Differential Privacy in New Settings
Differential privacy is a recent notion of privacy tailored to the problem of statistical disclosure control: how to release statistical information about a set of people without ...
Cynthia Dwork
SODA
2010
ACM
147views Algorithms» more  SODA 2010»
11 years 3 months ago
Energy Efficient Scheduling via Partial Shutdown
Motivated by issues of saving energy in data centers we define a collection of new problems referred to as "machine activation" problems. The central framework we introd...
Samir Khuller, Jian Li, Barna Saha
SODA
2010
ACM
143views Algorithms» more  SODA 2010»
11 years 4 months ago
Thin Partitions: Isoperimetric Inequalities and a Sampling Algorithm for Star Shaped Bodies
Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an efficient algorithm for sampling a giv...
Karthekeyan Chandrasekaran, Daniel Dadush, Santosh...
SODA
2010
ACM
178views Algorithms» more  SODA 2010»
11 years 4 months ago
1-Pass Relative-Error Lp-Sampling with Applications
Morteza Monemizadeh, David P. Woodruff
SODA
2010
ACM
181views Algorithms» more  SODA 2010»
11 years 4 months ago
Near-Optimal Sublinear Time Algorithms for Ulam Distance
We give near-tight bounds for estimating the edit distance between two non-repetitive strings (Ulam distance) with constant approximation, in sub-linear time. For two strings of l...
Alexandr Andoni, Huy L. Nguyen
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
11 years 4 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
SODA
2010
ACM
174views Algorithms» more  SODA 2010»
11 years 4 months ago
Cache-Oblivious Dynamic Dictionaries with Update/Query Tradeoffs
Several existing cache-oblivious dynamic dictionaries achieve O(logB N) (or slightly better O(logB N M )) memory transfers per operation, where N is the number of items stored, M ...
Gerth Stølting Brodal, Erik D. Demaine, Jer...
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
11 years 4 months ago
Hardness Results for Homology Localization
: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...
Chao Chen, Daniel Freedman
SODA
2010
ACM
144views Algorithms» more  SODA 2010»
11 years 4 months ago
Cell-Probe Lower Bounds for Succinct Partial Sums
The partial sums problem in succinct data structures asks to preprocess an array A[1 . . n] of bits into a data structure using as close to n bits as possible, and answer queries ...
Mihai Patrascu, Emanuele Viola
books