Sciweavers

2834 search results - page 319 / 567
» Representing Trees with Constraints
Sort
View
CSL
1999
Springer
15 years 6 months ago
A hidden Markov-model-based trainable speech synthesizer
This paper presents a new approach to speech synthesis in which a set of cross-word decision-tree state-clustered context-dependent hidden Markov models are used to define a set o...
R. E. Donovan, Philip C. Woodland
TCSV
2002
151views more  TCSV 2002»
15 years 6 months ago
Object-based video coding by global-to-local motion segmentation
Abstract--In this paper, we describe an object-based video compression scheme based on the derivation and efficient coding of motion boundaries. First, we recursively identify a sm...
Ahsan Shamim, John A. Robinson
IV
2010
IEEE
193views Visualization» more  IV 2010»
15 years 5 months ago
Drawing Clustered Bipartite Graphs in Multi-circular Style
Abstract—Bipartite graphs are often used to illustrate relationships between two sets of data, such as web pages and visitors. At the same time, information is often organized hi...
Takao Ito, Kazuo Misue, Jiro Tanaka
WALCOM
2010
IEEE
351views Algorithms» more  WALCOM 2010»
15 years 4 months ago
Pathwidth and Searching in Parameterized Threshold Graphs
Treewidth and pathwidth are important graph parameters that represent how close the graph is to trees and paths respectively. We calculate treewidth and pathwidth on parameterized ...
D. Sai Krishna, T. V. Thirumala Reddy, B. Sai Shas...
ER
2010
Springer
124views Database» more  ER 2010»
15 years 4 months ago
Integrity Assurance for RESTful XML
The REpresentational State Transfer (REST) represents an extensible, easy and elegant architecture for accessing web-based resources. REST alone and in combination with XML is fast...
Sebastian Graf, Lukas Lewandowski, Marcel Waldvoge...