Sciweavers

970 search results - page 91 / 194
» On encodings of spanning trees
Sort
View
ICCS
2004
Springer
14 years 2 months ago
An Incremental Editor for Dynamic Hierarchical Drawing of Trees
We present an incremental tree editor based on algorithms for manipulating shape functions. The tree layout is hierarchical, left-to-right. Nodes of variable size and shape are sup...
David Workman, Margaret Bernard, Steven Pothoven
EMNLP
2009
13 years 6 months ago
Natural Language Generation with Tree Conditional Random Fields
This paper presents an effective method for generating natural language sentences from their underlying meaning representations. The method is built on top of a hybrid tree repres...
Wei Lu, Hwee Tou Ng, Wee Sun Lee
CORR
2010
Springer
186views Education» more  CORR 2010»
13 years 9 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
TIT
2008
74views more  TIT 2008»
13 years 8 months ago
Optimal Parsing Trees for Run-Length Coding of Biased Data
Abstract-- We study coding schemes which encode unconstrained sequences into run-length-limited (d, k)-constrained sequences. We present a general framework for the construction of...
Sharon Aviran, Paul H. Siegel, Jack K. Wolf
QEST
2008
IEEE
14 years 3 months ago
Quasi-Birth-Death Processes, Tree-Like QBDs, Probabilistic 1-Counter Automata, and Pushdown Systems
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
Kousha Etessami, Dominik Wojtczak, Mihalis Yannaka...