Sciweavers

675 search results - page 48 / 135
» On Compression of Parse Trees
Sort
View
XSYM
2009
Springer
139views Database» more  XSYM 2009»
14 years 3 months ago
A Data Parallel Algorithm for XML DOM Parsing
Abstract. The extensible markup language XML has become the de facto standard for information representation and interchange on the Internet. XML parsing is a core operation perfor...
Bhavik Shah, Praveen Rao, Bongki Moon, Mohan Rajag...
AFRIGRAPH
2006
ACM
14 years 2 months ago
Compression of dense and regular point clouds
We present a simple technique for single-rate compression of point clouds sampled from a surface, based on a spanning tree of the points. Unlike previous methods, we predict futur...
Bruce Merry, Patrick Marais, James E. Gain
AAAI
2011
12 years 8 months ago
Tree Sequence Kernel for Natural Language
We propose Tree Sequence Kernel (TSK), which implicitly exhausts the structure features of a sequence of subtrees embedded in the phrasal parse tree. By incorporating the capabili...
Jun Sun, Min Zhang, Chew Lim Tan
TIP
2008
131views more  TIP 2008»
13 years 8 months ago
Hyperspectral Image Compression: Adapting SPIHT and EZW to Anisotropic 3-D Wavelet Coding
Abstract--Hyperspectral images present some specific characteristics that should be used by an efficient compression system. In compression, wavelets have shown a good adaptability...
Emmanuel Christophe, Corinne Mailhes, Pierre Duham...
ASPDAC
2010
ACM
183views Hardware» more  ASPDAC 2010»
13 years 6 months ago
Multi-operand adder synthesis on FPGAs using generalized parallel counters
Multi-operand adders, which are also found in parallel multipliers, usually consist of the compression trees which reduce the number of operands per a bit to two, and the carrypro...
Taeko Matsunaga, Shinji Kimura, Yusuke Matsunaga