6881 search results - page 1132 / 1377 » Motivation |
183
click to vote
INLG
2004
Springer
16 years 12 hour ago
2004
Springer
Ambiguity in the output is a concern for NLG in general. This paper considers the case of structural ambiguity in spoken language generation. We present an algorithm which inserts ...
177
click to vote
ISAAC
2004
Springer
16 years 12 hour ago
2004
Springer
The Steiner tree problem asks for a minimum cost tree spanning a given set of terminals S ⊆ V in a weighted graph G = (V, E, c), c : E → R+ . In this paper we consider a genera...
201
click to vote
ISAAC
2004
Springer
16 years 12 hour ago
2004
Springer
Abstract. Range searching over tree cross products – a variant of classic range searching – recently has been introduced by Buchsbaum et al. (Proc. 8th ESA, vol. 1879 of LNCS, ...
191
click to vote
ISAAC
2004
Springer
16 years 12 hour ago
2004
Springer
For c ∈ R, a c-spanner is a subgraph of a complete Euclidean graph satisfying that between any two vertices there exists a path of weighted length at most c times their geometric...
170
click to vote
ISAAC
2004
Springer
16 years 12 hour ago
2004
Springer
Motivation: Motif detection for DNA sequences has many important applications in biological studies, e.g., locating binding sites and regulatory signals, and designing genetic prob...