13841 search results - page 2615 / 2769 » Algorithms and Constraint Programming |
127
click to vote
STRINGOLOGY
2004
15 years 4 months ago
2004
We investigate the shortest common superstring problem (SCSSP). As SCSSP is APX-complete it cannot be approximated within an arbitrarily small performance ratio. One heuristic tha...
115
Voted
UAI
2004
15 years 4 months ago
2004
We show that the class of strongly connected graphical models with treewidth at most k can be properly efficiently PAC-learnt with respect to the Kullback-Leibler Divergence. Prev...
137
click to vote
NIPS
2003
15 years 4 months ago
2003
In this paper, sparse representation (factorization) of a data matrix is first discussed. An overcomplete basis matrix is estimated by using the K−means method. We have proved ...
123
click to vote
NIPS
2003
15 years 4 months ago
2003
We describe a Markov chain method for sampling from the distribution of the hidden state sequence in a non-linear dynamical system, given a sequence of observations. This method u...
102
click to vote
EI
1998
15 years 4 months ago
1998
The traditional techniques of image capture, scanning, proofing, and separating do not take advantage of colorimetry and spectrophotometry. For critical color-matching application...