3894 search results - page 467 / 779 » Approximation Algorithms for Biclustering Problems |
175
click to vote
PARA
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. This paper presents new efficient parallel algorithms for finding approximate solutions to graph coloring problems. We consider an existing shared memory parallel graph...
138
Voted
DCC
1998
IEEE
15 years 8 months ago
1998
IEEE
In this paper we address the problem of searching in LZW compressed text directly, and present a new algorithm for finding multiple patterns by simulating the move of the Aho-Cora...
143
click to vote
ISSAC
1995
Springer
15 years 8 months ago
1995
Springer
This paper introduces singular value decomposition (SVD) algorithms for some standard polynomial computations, in the case where the coefficients are inexact or imperfectly known....
143
click to vote
UAI
2008
15 years 6 months ago
2008
Approximate inference in dynamic systems is the problem of estimating the state of the system given a sequence of actions and partial observations. High precision estimation is fu...
130
Voted
NIPS
1990
15 years 5 months ago
1990
In this paper, we show that the LVQ learning algorithm converges to locally asymptotic stable equilibria of an ordinary differential equation. We show that the learning algorithm ...