1091 search results - page 49 / 219 » Approximation Algorithms for Data Placement Problems |
122
click to vote
ESA
2008
Springer
15 years 3 months ago
2008
Springer
Metric Labeling problems have been introduced as a model for understanding noisy data with pair-wise relations between the data points. One application of labeling problems with pa...
105
click to vote
PODS
2006
ACM
16 years 2 months ago
2006
ACM
Recently, there has been an increased focus on modeling uncertainty by distributions. Suppose we wish to compute a function of a stream whose elements are samples drawn independen...
144
click to vote
TCC
2012
Springer
13 years 9 months ago
2012
Springer
In this paper we study the problem of approximately releasing the cut function of a graph while preserving differential privacy, and give new algorithms (and new analyses of exis...
129
click to vote
SODA
2010
ACM
15 years 11 months ago
2010
ACM
We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
114
click to vote
DIALM
2004
ACM
15 years 7 months ago
2004
ACM
In this paper, we consider energy-efficient gathering of correlated data in sensor networks. We focus on single-input coding strategies in order to aggregate correlated data. For ...