Sciweavers

773 search results - page 118 / 155
» Suffix Trees on Words
Sort
View
IPL
2002
118views more  IPL 2002»
14 years 11 months ago
Lower bounds for approximate polygon decomposition and minimum gap
We consider the problem of decomposing polygons (with holes) into various types of simpler polygons. We focus on the problem of partitioning a rectilinear polygon, with holes, int...
Joachim Gudmundsson, Thore Husfeldt, Christos Levc...
CSL
1999
Springer
14 years 11 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
PR
2010
158views more  PR 2010»
14 years 10 months ago
Out-of-bag estimation of the optimal sample size in bagging
The performance of m-out-of-n bagging with and without replacement in terms of the sampling ratio (m/n) is analyzed. Standard bagging uses resampling with replacement to generate ...
Gonzalo Martínez-Muñoz, Alberto Su&a...
RSA
2010
89views more  RSA 2010»
14 years 10 months ago
Edge flows in the complete random-lengths network
Consider the complete n-vertex graph whose edge-lengths are independent exponentially distributed random variables. Simultaneously for each pair of vertices, put a constant flow ...
David J. Aldous, Shankar Bhamidi
TCS
2010
14 years 10 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...