7930 search results - page 535 / 1586 » Greedy in Approximation Algorithms |
184
click to vote
WOB
2004
15 years 8 months ago
2004
ABSTRACT. The computationally challenging problem of reconstructing the phylogeny of a set of contemporary data, such as DNA sequences or morphological attributes, was treated by a...
202
click to vote
IBIS
2006
15 years 7 months ago
2006
: Schema matching is the task of finding semantic correspondences between elements of two schemas, which plays a key role in many database applications. In this paper, we cast the ...
224
click to vote
TIP
2010
15 years 5 months ago
2010
In this paper we model the components of the compressive sensing (CS) problem, i.e., the signal acquisition process, the unknown signal coefficients and the model parameters for ...
280
click to vote
ICDAR
2009
IEEE
15 years 4 months ago
2009
IEEE
We report an automatic feature discovery method that achieves results comparable to a manually chosen, larger feature set on a document image content extraction problem: the locat...
180
click to vote
FOCS
2007
IEEE
16 years 1 months ago
2007
IEEE
We continue the recent line of work on the connection between semidefinite programming-based approximation algorithms and the Unique Games Conjecture. Given any boolean 2-CSP (or...