1351 search results - page 62 / 271 » Learning from compressed observations |
104
click to vote
ICML
2008
IEEE
15 years 10 months ago
2008
IEEE
Hidden Markov models assume that observations in time series data stem from some hidden process that can be compactly represented as a Markov chain. We generalize this model by as...
IEEEPACT
2005
IEEE
15 years 3 months ago
2005
IEEE
We describe the design, generation and compression of the extended whole program path (eWPP) representation that not only captures the control flow history of a program execution...
CORR
2007
Springer
14 years 10 months ago
2007
Springer
—Motivated by questions in lossy data compression and by theoretical considerations, the problem of estimating the rate-distortion function of an unknown (not necessarily discret...
TIT
2002
14 years 9 months ago
2002
-- We characterize the best achievable performance of lossy compression algorithms operating on arbitrary random sources, and with respect to general distortion measures. Direct an...
SCIA
2005
Springer
15 years 3 months ago
2005
Springer
We propose reliable outdoor object detection on mobile phone imagery from off-the-shelf devices. With the goal to provide both robust object detection and reduction of computation...