Sciweavers

70 search results - page 9 / 14
» Data Compression with Restricted Parsings
Sort
View
DCC
2007
IEEE
14 years 7 months ago
Distributed Functional Compression through Graph Coloring
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...
Devavrat Shah, Muriel Médard, Sidharth Jagg...
ACL
1998
13 years 8 months ago
Some Properties of Preposition and Subordinate Conjunction Attachments
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...
Alexander S. Yeh, Marc B. Vilain
SSDBM
2003
IEEE
95views Database» more  SSDBM 2003»
14 years 23 days ago
A Quad-Tree Based Multiresolution Approach for Two-dimensional Summary Data
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...
Francesco Buccafurri, Filippo Furfaro, Domenico Sa...
AAAI
2008
13 years 9 months ago
An Effective and Robust Method for Short Text Classification
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...
Victoria Bobicev, Marina Sokolova
NIPS
1992
13 years 8 months ago
A Note on Learning Vector Quantization
Vector Quantization is useful for data compression. Competitive Learning which minimizes reconstruction error is an appropriate algorithm for vector quantization of unlabelled dat...
Virginia R. de Sa, Dana H. Ballard