389 search results - page 41 / 78 » Some natural decision problems in automatic graphs |
NAACL
2003
13 years 8 months ago
2003
Homograph ambiguity is an original issue in Text-to-Speech (TTS). To disambiguate homograph, several efficient approaches have been proposed such as part-of-speech (POS) n-gram, B...
FSTTCS
2010
Springer
13 years 5 months ago
2010
Springer
We study the computational complexity of basic decision problems for one-counter simple stochastic games (OC-SSGs), under various objectives. OC-SSGs are 2-player turn-based stoch...
ECCV
2004
Springer
14 years 24 days ago
2004
Springer
Abstract. There is a growing trend toward emotional intelligence in humancomputer interaction paradigms. In order to react appropriately to a human, the computer would need to have...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
PR
2007
13 years 7 months ago
2007
In this paper, we make use of the relationship between the Laplace–Beltrami operator and the graph Laplacian, for the purposes of embedding a graph onto a Riemannian manifold. T...