Sciweavers

2294 search results - page 133 / 459
» From Path Graphs to Directed Path Graphs
Sort
View
DM
2007
142views more  DM 2007»
14 years 10 months ago
Dominating direct products of graphs
An upper bound for the domination number of the direct product of graphs is proved. It in particular implies that for any graphs G and H, γ(G × H) ≤ 3γ(G)γ(H). Graphs with a...
Bostjan Bresar, Sandi Klavzar, Douglas F. Rall
ICPR
2006
IEEE
15 years 11 months ago
Recover Writing Trajectory from Multiple Stroked Image Using Bidirectional Dynamic Search
The recovery of writing trajectory from offline handwritten image is generally regarded as a difficult problem [1]. This paper introduced a method to recover the writing trajector...
Yu Qiao, Makoto Yasuhara
CORR
2006
Springer
101views Education» more  CORR 2006»
14 years 10 months ago
Context-Sensitive Languages, Rational Graphs and Determinism
We investigate families of infinite automata for context-sensitive languages. An infinite automaton is an infinite labeled graph with two sets of initial and final vertices. Its la...
Arnaud Carayol, Antoine Meyer
ACL
2010
14 years 8 months ago
Learning to Follow Navigational Directions
We present a system that learns to follow navigational natural language directions. Where traditional models learn from linguistic annotation or word distributions, our approach i...
Adam Vogel, Daniel Jurafsky
COMPGEOM
2010
ACM
15 years 3 months ago
Output-sensitive algorithm for the edge-width of an embedded graph
Let G be an unweighted graph of complexity n cellularly embedded in a surface (orientable or not) of genus g. We describe improved algorithms to compute (the length of) a shortest...
Sergio Cabello, Éric Colin de Verdiè...