1389 search results - page 152 / 278 » Improved Approximation Algorithms for Label Cover Problems |
CSB
2004
IEEE
15 years 7 months ago
2004
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as maximum parsimony (MP) and maximum likelihood (ML). Conventional MP heuristics for produc...
143
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
Automatic image categorization using low-level features is a challenging research topic in computer vision. In this paper, we formulate the image categorization problem as a multi...
116
click to vote
CLA
2007
15 years 4 months ago
2007
Boolean factor analysis aims at decomposing an objects × attributes Boolean matrix I into a Boolean product of an objects × factors Boolean matrix A and a factors × attributes B...
260
click to vote
ICDE
2009
IEEE
16 years 5 months ago
2009
IEEE
Abstract-- Answering approximate queries on string collections is important in applications such as data cleaning, query relaxation, and spell checking, where inconsistencies and e...
140
click to vote
JMLR
2010
14 years 10 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...