Sciweavers

675 search results - page 47 / 135
» On Compression of Parse Trees
Sort
View
ACL
2012
11 years 11 months ago
Estimating Compact Yet Rich Tree Insertion Grammars
We present a Bayesian nonparametric model for estimating tree insertion grammars (TIG), building upon recent work in Bayesian inference of tree substitution grammars (TSG) via Dir...
Elif Yamangil, Stuart M. Shieber
INFOCOM
2010
IEEE
13 years 6 months ago
On Computing Compression Trees for Data Collection in Wireless Sensor Networks
We address the problem of efficiently gathering correlated data from a wireless sensor network, with the aim of designing algorithms with provable optimality guarantees, and unders...
Jian Li, Amol Deshpande, Samir Khuller
TCBB
2010
106views more  TCBB 2010»
13 years 3 months ago
Quantifying the Degree of Self-Nestedness of Trees: Application to the Structural Analysis of Plants
In this paper we are interested in the problem of approximating trees by trees with a particular self-nested structure. Self-nested trees are such that all their subtrees of a give...
Christophe Godin, Pascal Ferraro
EXPERT
2007
76views more  EXPERT 2007»
13 years 8 months ago
Online Sequential Prediction via Incremental Parsing: The Active LeZi Algorithm
Prediction is an important component in a variety of domains. Intelligent systems that can predict future events are better enabled to make more informed, and therefore more relia...
Karthik Gopalratnam, Diane J. Cook
INFOCOM
2010
IEEE
13 years 7 months ago
Leaping Multiple Headers in a Single Bound: Wire-Speed Parsing Using the Kangaroo System
—More fundamental than IP lookups and packet classification in routers is the extraction of fields such as IP Dest and TCP Ports that determine packet forwarding. While parsing...
Christos Kozanitis, John Huber, Sushil Singh, Geor...