SODA

2010

ACM

13 years 2 months ago
2010

ACM

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...

SODA

2010

ACM

13 years 2 months ago
2010

ACM

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 ...

SODA

2010

ACM

13 years 2 months ago
2010

ACM

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...

SODA

2010

ACM

13 years 2 months ago
2010

ACM

Star-shaped bodies are an important nonconvex generalization of convex bodies (e.g., linear programming with violations). Here we present an eﬃcient algorithm for sampling a giv...

SODA

2010

ACM

13 years 2 months ago
2010

ACM

SODA

2010

ACM

13 years 2 months ago
2010

ACM

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...

SODA

2010

ACM

13 years 2 months ago
2010

ACM

We present an exact algorithm that decides, for every ﬁxed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisﬁ...

SODA

2010

ACM

13 years 2 months ago
2010

ACM

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 ...

SODA

2010

ACM

13 years 2 months ago
2010

ACM

: © Hardness Results for Homology Localization Chao Chen, Daniel Freedman HP Laboratories HPL-2009-374 algebraic topology, homology, localization We address the problem of localiz...

SODA

2010

ACM

13 years 2 months ago
2010

ACM

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 ...