Sciweavers

1000 search results - page 92 / 200
» Dependency Tree Automata
Sort
View
ICPR
2004
IEEE
16 years 1 months ago
A Unification Framework for Tree and Block Wavelet Encoders
Wavelet transform coefficient encoders are broadly categorized as depending on correlations: across sub-bands through a zerotree, or within sub-bands through a block quad-tree. Th...
Andy C. Downton, Martin Fleury, Xiao Wei Yin
DAM
2010
66views more  DAM 2010»
14 years 12 months ago
On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width
Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework an...
Robert Ganian, Petr Hlinený
DSOM
2004
Springer
15 years 5 months ago
A Formal Validation Model for the Netconf Protocol
Netconf is a protocol proposed by the IETF that defines a set of operations for network configuration. One of the main issues of Netconf is to define operations such as validate...
Sylvain Hallé, Rudy Deca, Omar Cherkaoui, R...
EMNLP
2011
13 years 11 months ago
Generating Aspect-oriented Multi-Document Summarization with Event-aspect model
In this paper, we propose a novel approach to automatic generation of aspect-oriented summaries from multiple documents. We first develop an event-aspect LDA model to cluster sen...
Peng Li, Yinglin Wang, Wei Gao, Jing Jiang
ICPR
2002
IEEE
15 years 4 months ago
Tree Pruning for Output Coded Ensembles
Output Coding is a method of converting a multiclass problem into several binary subproblems and gives an ensemble of binary classifiers. Like other ensemble methods, its perform...
Terry Windeatt, Gholamreza Ardeshir