113 search results - page 19 / 23 » On solving a hard quadratic 3-dimensional assignment problem |
187
click to vote
NIPS
2007
15 years 7 months ago
2007
We present a novel message passing algorithm for approximating the MAP problem in graphical models. The algorithm is similar in structure to max-product but unlike max-product it ...
183
click to vote
BIBE
2005
IEEE
15 years 11 months ago
2005
IEEE
We propose a method for finding seeds for the local alignment of two nucleotide sequences. Our method uses randomized algorithms to find approximate seeds. We present a dynamic ...
157
click to vote
COMPGEOM
2006
ACM
15 years 12 months ago
2006
ACM
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
150
click to vote
SIAMSC
2010
15 years 4 months ago
2010
We propose a fast algorithm for solving the ℓ1-regularized minimization problem minx∈Rn µ x 1 + Ax − b 2 2 for recovering sparse solutions to an undetermined system of linea...
163
click to vote
CIKM
2007
Springer
16 years 3 days ago
2007
Springer
Several problems in text categorization are too hard to be solved by standard bag-of-words representations. Work in kernel-based learning has approached this problem by (i) consid...