7930 search results - page 361 / 1586 » Greedy in Approximation Algorithms |
144
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...
164
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 ...
209
Voted
MICS
2007
15 years 6 months ago
2007
The task of determining the approximate greatest common divisor (GCD) of more than two univariate polynomials with inexact coefficients can be formulated as computing for a given B...
207
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...
141
click to vote
ICML
2002
IEEE
16 years 7 months ago
2002
IEEE
We apply the Message from Monte Carlo (MMC) algorithm to inference of univariate polynomials. MMC is an algorithm for point estimation from a Bayesian posterior sample. It partiti...