Sciweavers

9886 search results - page 20 / 1978
» Learning Compressible Models
Sort
View
ICML
2006
IEEE
15 years 10 months ago
Estimating relatedness via data compression
We show that it is possible to use data compression on independently obtained hypotheses from various tasks to algorithmically provide guarantees that the tasks are sufficiently r...
Brendan Juba
WWW
2001
ACM
15 years 10 months ago
Algorithms and programming models for efficient representation of XML for Internet applications
XML is poised to take the World-Wide-Web to the next level of innovation. XML data, large or small, with or without associated schema, will be exchanged between increasing number ...
Neel Sundaresan, Reshad Moussa
ICIP
2003
IEEE
15 years 11 months ago
Image compression with on-line and off-line learning
Images typically contain smooth regions, which are easily compressed by linear transforms, and high activity regions (edges, textures), which are harder to compress. To compress t...
Patrice Y. Simard, Christopher J. C. Burges, David...
81
Voted
COLING
2008
14 years 11 months ago
Sentence Compression Beyond Word Deletion
In this paper we generalise the sentence compression task. Rather than simply shorten a sentence by deleting words or constituents, as in previous work, we rewrite it using additi...
Trevor Cohn, Mirella Lapata
SIAMIS
2011
14 years 4 months ago
Large Scale Bayesian Inference and Experimental Design for Sparse Linear Models
Abstract. Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or superresolution, can be addressed by maxi...
Matthias W. Seeger, Hannes Nickisch