3894 search results - page 328 / 779 » Approximation Algorithms for Biclustering Problems |
222
click to vote
ACL
1997
15 years 8 months ago
1997
Although adequate models of human language for syntactic analysis and semantic interpretation are of at least contextfree complexity, for applications such as speech processing in...
204
click to vote
TIP
2008
15 years 7 months ago
2008
This paper presents recursive cavity modeling--a principled, tractable approach to approximate, near-optimal inference for large Gauss-Markov random fields. The main idea is to su...
220
click to vote
SIAMMAX
2010
15 years 2 months ago
2010
Abstract. Given a symmetric positive definite matrix A, we compute a structured approximate Cholesky factorization A RT R up to any desired accuracy, where R is an upper triangula...
206
click to vote
WWW
2009
ACM
16 years 8 months ago
2009
ACM
To deal with the problem of empty or too little answers returned from a Web database in response to a user query, this paper proposes a novel approach to provide relevant and rank...
225
click to vote
STOC
2010
ACM
16 years 6 days ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...