Sciweavers

50 search results - page 6 / 10
» Language Compression and Pseudorandom Generators
Sort
View
ICALP
2011
Springer
12 years 11 months ago
New Algorithms for Learning in Presence of Errors
We give new algorithms for a variety of randomly-generated instances of computational problems using a linearization technique that reduces to solving a system of linear equations...
Sanjeev Arora, Rong Ge
MOBICOM
2000
ACM
13 years 11 months ago
A unified header compression framework for low-bandwidth links
Compressing protocol headers has traditionally been an attractive way of conserving bandwidth over low-speed links, including those in wireless systems. However, despite the growt...
Jeremy Lilley, Jason Yang, Hari Balakrishnan, Srin...
IPM
2008
75views more  IPM 2008»
13 years 7 months ago
Single-document and multi-document summarization techniques for email threads using sentence compression
We present two approaches to email thread summarization: Collective Message Summarization (CMS) applies a multi-document summarization approach, while Individual Message Summariza...
David M. Zajic, Bonnie J. Dorr, Jimmy J. Lin
CASES
2005
ACM
13 years 9 months ago
A post-compilation register reassignment technique for improving hamming distance code compression
Code compression is a field where compression ratios between compiler-generated code and subsequent compressed code are highly dependent on decisions made at compile time. Most op...
Montserrat Ros, Peter Sutton
EMNLP
2010
13 years 5 months ago
Title Generation with Quasi-Synchronous Grammar
The task of selecting information and rendering it appropriately appears in multiple contexts in summarization. In this paper we present a model that simultaneously optimizes sele...
Kristian Woodsend, Yansong Feng, Mirella Lapata