Sciweavers

3475 search results - page 137 / 695
» Backbones in Optimization and Approximation
Sort
View
SODA
2010
ACM
164views Algorithms» more  SODA 2010»
16 years 3 months ago
Differentially Private Approximation Algorithms
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...
FOCS
2009
IEEE
16 years 1 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
SSDBM
2003
IEEE
164views Database» more  SSDBM 2003»
15 years 11 months ago
Approximate String Joins
String data is ubiquitous, and its management has taken on particular importance in the past few years. Approximate queries are very important on string data especially for more c...
Divesh Srivastava
ICML
2004
IEEE
16 years 7 months ago
Generalized low rank approximations of matrices
The problem of computing low rank approximations of matrices is considered. The novel aspect of our approach is that the low rank approximations are on a collection of matrices. W...
Jieping Ye
KDD
2008
ACM
138views Data Mining» more  KDD 2008»
16 years 6 months ago
Quantitative evaluation of approximate frequent pattern mining algorithms
Traditional association mining algorithms use a strict definition of support that requires every item in a frequent itemset to occur in each supporting transaction. In real-life d...
Rohit Gupta, Gang Fang, Blayne Field, Michael Stei...