Sciweavers

1188 search results - page 73 / 238
» Extended Graph Unification
Sort
View
CSL
2004
Springer
13 years 11 months ago
Arc minimization in finite-state decoding graphs with cross-word acoustic context
Recent approaches to large vocabulary decoding with finite state graphs have focused on the use of state minimization algorithms to produce relatively compact graphs. This paper e...
François Yvon, Geoffrey Zweig, George Saon
ICPR
2010
IEEE
13 years 9 months ago
Semi-supervised Graph Learning: Near Strangers or Distant Relatives
In this paper, an easily implemented semi-supervised graph learning method is presented for dimensionality reduction and clustering, using the most of prior knowledge from limited...
Weifu Chen, Guocan Feng
COR
2011
13 years 6 months ago
On the application of graph colouring techniques in round-robin sports scheduling
The purpose of this paper is twofold. First, it explores the issue of producing valid, compact round-robin sports schedules by considering the problem as one of graph colouring. U...
R. Lewis, J. Thompson
STACS
2010
Springer
14 years 6 months ago
Construction Sequences and Certifying 3-Connectedness
Given two 3-connected graphs G and H, a construction sequence constructs G from H (e. g. from the K4) with three basic operations, called the Barnette-Grünbaum operations. These...
Jens M. Schmidt
CDC
2008
IEEE
137views Control Systems» more  CDC 2008»
14 years 5 months ago
Increasingly correct message passing averaging algorithms
Abstract— We study averaging algorithms, when implemented in large networks of wirelessly connected elements. We extend the notion of “Increasing Correctness” (IC) which was ...
Kurt Plarre, Francesco Bullo