7015 search results - page 30 / 1403 » Approximation algorithms for co-clustering |
127
click to vote
WEA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
135
click to vote
WINE
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We consider the problem of computing additively approximate Nash equilibria in non-cooperative two-player games. We provide a new polynomial time algorithm that achieves ...
103
click to vote
CPE
1998
Springer
15 years 8 months ago
1998
Springer
Abstract. Approximate Mean Value Analysis (MVA) is a popular technique for analyzing queueing networks because of the efficiency and accuracy that it affords. In this paper, we pre...
120
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
We propose a new algorithm for Approximate Joint Diagonalization (AJD) with two main advantages over existing state-of-the-art algorithms: Improved overall running speed, especial...
155
click to vote
WADS
2005
Springer
15 years 9 months ago
2005
Springer
Given a forest F = (V, E) and a positive integer D, we consider the problem of finding a minimum number of new edges E such that in the augmented graph H = (V, E∪E ) any pair of...