Sciweavers

675 search results - page 39 / 135
» On Compression of Parse Trees
Sort
View
NIPS
2001
13 years 10 months ago
A Bayesian Model Predicts Human Parse Preference and Reading Times in Sentence Processing
Narayanan and Jurafsky (1998) proposed that human language comprehension can be modeled by treating human comprehenders as Bayesian reasoners, and modeling the comprehension proce...
S. Narayanan, Daniel Jurafsky
ACL
1998
13 years 10 months ago
An Alternative LR Algorithm for TAGs
We present a new LR algorithm for treeadjoining grammars. It is an alternative to an existing algorithm that is shown to be incorrect. Furthermore, the new algorithm is much simpl...
Mark-Jan Nederhof
MICAI
2007
Springer
14 years 2 months ago
Variants of Tree Kernels for XML Documents
In this paper, we discuss tree kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees, in which every node might...
Peter Geibel, Helmar Gust, Kai-Uwe Kühnberger
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 8 months ago
Color Image Compression Based On Wavelet Packet Best Tree
In Image Compression, the researchers' aim is to reduce the number of bits required to represent an image by removing the spatial and spectral redundancies. Recently discrete...
Gajanan K. Kharate, Varsha H. Patil
VISUAL
1999
Springer
14 years 1 months ago
Query Processing and Optimization for Pictorial Query Trees
Abstract. Methods for processing of pictorial queries speci ed by pictorial query trees are presented. Leaves of a pictorial query tree correspond to individual pictorial queries w...
Aya Soffer, Hanan Samet