10901 search results - page 273 / 2181 » Approximations in Distributed Optimization |
174
click to vote
ICA
2004
Springer
16 years 16 hour 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...
165
click to vote
STOC
2010
ACM
15 years 11 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...
174
click to vote
RECOMB
1997
Springer
15 years 10 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...
200
click to vote
SODA
1997
ACM
15 years 8 months ago
1997
ACM
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
162
click to vote
IPL
2008
15 years 6 months ago
2008
The problem of biclustering consists of the simultaneous clustering of rows and columns of a matrix such that each of the submatrices induced by a pair of row and column clusters ...