Sciweavers

675 search results - page 88 / 135
» On Compression of Parse Trees
Sort
View
DAS
2006
Springer
14 years 12 days ago
Structural Analysis of Mathematical Formulae with Verification Based on Formula Description Grammar
In this paper, a reliable and efficient structural analysis method for mathematical formulae is proposed for practical mathematical OCR. The proposed method consists of three steps...
Seiichi Toyota, Seiichi Uchida, Masakazu Suzuki
EMNLP
2010
13 years 6 months ago
Automatic Detection and Classification of Social Events
In this paper we introduce the new task of social event extraction from text. We distinguish two broad types of social events depending on whether only one or both parties are awa...
Apoorv Agarwal, Owen Rambow
DCC
2004
IEEE
14 years 8 months ago
Fast Compression with a Static Model in High-Order Entropy
We report on a simple encoding format called wzip for decompressing block-sorting transforms, such as the Burrows-Wheeler Transform (BWT). Our compressor uses the simple notions o...
Luca Foschini, Roberto Grossi, Ankur Gupta, Jeffre...
DCC
2004
IEEE
14 years 8 months ago
Reduced Complexity Wavelet-Based Predictive Coding of Hyperspectral Images for FPGA Implementation
We present an algorithm for lossy compression of hyperspectral images for implementation on field programmable gate arrays (FPGA). To greatly reduce the bit rate required to code ...
Agnieszka C. Miguel, Amanda R. Askew, Alexander Ch...
TIT
1998
123views more  TIT 1998»
13 years 8 months ago
The Minimum Description Length Principle in Coding and Modeling
—We review the principles of Minimum Description Length and Stochastic Complexity as used in data compression and statistical modeling. Stochastic complexity is formulated as the...
Andrew R. Barron, Jorma Rissanen, Bin Yu