Sciweavers

361 search results - page 11 / 73
» Relaxed Gabriel Graphs
Sort
View
LREC
2008
174views Education» more  LREC 2008»
13 years 9 months ago
Automatic Phoneme Segmentation with Relaxed Textual Constraints
Speech synthesis by unit selection requires the segmentation of a large single speaker high quality recording. Automatic speech recognition techniques, e.g. Hidden Markov Models (...
Pierre Lanchantin, Andrew C. Morris, Xavier Rodet,...
BIRTHDAY
2005
Springer
14 years 1 months ago
Graph Transformation in Molecular Biology
In the beginning, one of the main fields of application of graph transformation was biology, and more specifically morphology. Later, however, it was like if the biological appli...
Francesc Rosselló, Gabriel Valiente
DAM
2010
107views more  DAM 2010»
13 years 7 months ago
Codes from lattice and related graphs, and permutation decoding
Codes of length n2 and dimension 2n - 1 or 2n - 2 over the field Fp, for any prime p, that can be obtained from designs associated with the complete bipartite graph Kn,n and its l...
Jennifer D. Key, Bernardo Gabriel Rodrigues
WG
2001
Springer
13 years 12 months ago
(k, +)-Distance-Hereditary Graphs
In this work we introduce, characterize, and provide algorithmic results for (k, +)–distance-hereditary graphs, k ≥ 0. These graphs can be used to model interconnection networ...
Serafino Cicerone, Gianluca D'Ermiliis, Gabriele D...
COMGEO
2011
ACM
13 years 2 months ago
On crossing numbers of geometric proximity graphs
Let P be a set of n points in the plane. A geometric proximity graph on P is a graph where two points are connected by a straight-line segment if they satisfy some prescribed prox...
Bernardo M. Ábrego, Ruy Fabila Monroy, Silv...