70 search results - page 9 / 14 » Data Compression with Restricted Parsings |
DCC
2007
IEEE
15 years 10 months ago
2007
IEEE
We consider the distributed computation of a function of random sources with minimal communication. Specifically, given two discrete memoryless sources, X and Y , a receiver wishe...
83
Voted
ACL
1998
15 years 15 days ago
1998
Determining the attachments of prepositions and subordinate conjunctions is a key problem in parsing natural language. This paper presents a trainable approach to making these att...
103
Voted
SSDBM
2003
IEEE
15 years 4 months ago
2003
IEEE
In many application contexts, like statistical databases, scientific databases, query optimizers, OLAP, and so on, data are often summarized into synopses of aggregate values. Su...
102
click to vote
AAAI
2008
15 years 1 months ago
2008
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...
117
Voted
NIPS
1992
15 years 9 days ago
1992
Vector Quantization is useful for data compression. Competitive Learning which minimizes reconstruction error is an appropriate algorithm for vector quantization of unlabelled dat...