Sciweavers

675 search results - page 78 / 135
» On Compression of Parse Trees
Sort
View
EMNLP
2011
12 years 8 months ago
Generating Aspect-oriented Multi-Document Summarization with Event-aspect model
In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sen...
Peng Li, Yinglin Wang, Wei Gao, Jing Jiang
PIMRC
2008
IEEE
14 years 3 months ago
Dynamic data aggregation and transport in wireless sensor networks
—In wireless sensor networks, in-network aggregation is the process of compressing locally the data gathered by the sensor nodes, so that only the compressed data travel across s...
Mario O. Diaz, Kin K. Leung
ESA
2009
Springer
143views Algorithms» more  ESA 2009»
14 years 3 months ago
On Optimally Partitioning a Text to Improve Its Compression
In this paper we investigate the problem of partitioning an input string T in such a way that compressing individually its parts via a basecompressor C gets a compressed output th...
Paolo Ferragina, Igor Nitto, Rossano Venturini
FPGA
2001
ACM
152views FPGA» more  FPGA 2001»
14 years 1 months ago
A pipelined architecture for partitioned DWT based lossy image compression using FPGA's
Discrete wavelet transformations (DWT) followed by embedded zerotree encoding is a very efficient technique for image compression [2, 5, 4]. However, the algorithms proposed in l...
Jörg Ritter, Paul Molitor
MSV
2004
13 years 10 months ago
S(b)-Trees: An Optimal Balancing of Variable Length Keys
The paper studies the problem of maintaining external dynamic dictionaries with variable length keys. We introduce a new type of balanced trees, called S(b)-trees, which generaliz...
Konstantin V. Shvachko