3475 search results - page 99 / 695 » Backbones in Optimization and Approximation |
107
Voted
SIAMCOMP
2000
15 years 2 months ago
2000
We present a linear programming-based method for nding \gadgets", i.e., combinatorial structures reducing constraints of one optimization problem to constraints of another. A...
127
Voted
CORR
2012
Springer
13 years 10 months ago
2012
Springer
We propose a novel mechanism for answering sets of counting queries under differential privacy. Given a workload of counting queries, the mechanism automatically selects a differ...
117
Voted
ICA
2004
Springer
15 years 8 months ago
2004
Springer
We present a new algorithm for non-unitary approximate joint diagonalization (AJD), based on a “natural gradient”-type multiplicative update of the diagonalizing matrix, comple...
128
click to vote
STOC
2010
ACM
15 years 7 months ago
2010
ACM
We combine the work of Garg and K¨onemann, and Fleischer with ideas from dynamic graph algorithms to obtain faster (1 − ε)-approximation schemes for various versions of the mu...
119
Voted
RECOMB
1997
Springer
15 years 6 months ago
1997
Springer
We present a new polynomial time approximation scheme (PTAS) for tree alignment, which is an important variant of multiple sequence alignment. As in the existing PTASs in the liter...