Sciweavers

675 search results - page 89 / 135
» On Compression of Parse Trees
Sort
View
ECCV
2002
Springer
14 years 10 months ago
Dynamic Trees: Learning to Model Outdoor Scenes
Abstract. This paper considers the dynamic tree (DT) model, first introduced in [1]. A dynamic tree specifies a prior over structures of trees, each of which is a forest of one or ...
Nicholas J. Adams, Christopher K. I. Williams
CADE
2001
Springer
14 years 9 months ago
Context Trees
Context trees are a popular and effective tool for tasks such as compression, sequential prediction, and language modeling. We present an algebraic perspective of context trees for...
Harald Ganzinger, Robert Nieuwenhuis, Pilar Nivela
RANLP
2003
13 years 10 months ago
Structured parameter estimation for LFG-DOP
Despite its state-of-the-art performance, the Data Oriented Parsing (DOP) model has been shown to suffer from biased parameter estimation, and the good performance seems more the ...
Mary Hearne, Khalil Sima'an
ICIP
1998
IEEE
14 years 10 months ago
A Compressed Video Database Structured for Active Browsing and Search
We describe a unique system called ViBE (video browsing environment) for browsing and searching large databases of video sequences. The system first computes the DC sequence for a...
Cüneyt M. Taskiran, Charles A. Bouman, Edward...
CORR
2011
Springer
214views Education» more  CORR 2011»
13 years 8 days ago
Convex Approaches to Model Wavelet Sparsity Patterns
Statistical dependencies among wavelet coefficients are commonly represented by graphical models such as hidden Markov trees (HMTs). However, in linear inverse problems such as d...
Nikhil S. Rao, Robert D. Nowak, Stephen J. Wright,...