7150 search results - page 251 / 1430 » An Approximation Algorithm for Approximation Rank |
172
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...
142
click to vote
IPL
2008
15 years 6 months ago
2008
We consider the problem known as MAX-SATISFY: given a system of m linear equations over the rationals, find a maximum set of equations that can be satisfied. Let r be the width of...
160
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 ...
201
click to vote
SIGMOD
2011
ACM
14 years 9 months ago
2011
ACM
We demonstrate a system for querying probabilistic XML documents with simple XPath queries. A user chooses between a variety of query answering techniques, both exact and approxim...