254 search results - page 8 / 51 » Deterministic Soliton Graphs |
CORR
2007
Springer
14 years 11 months ago
2007
Springer
A synchronizing word of a deterministic automaton is a word in the alphabet of colors (considered as letters) of its edges that maps the automaton to a single state. A coloring of...
100
click to vote
CORR
2010
Springer
14 years 8 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
111
click to vote
SODA
2012
ACM
13 years 2 months ago
2012
ACM
We give the first linear kernels for DOMINATING SET and CONNECTED DOMINATING SET problems on graphs excluding a fixed graph H as a minor. In other words, we give polynomial time...
106
click to vote
IAT
2009
IEEE
15 years 3 months ago
2009
IEEE
Abstract—Developing autonomous systems that patrol environments for detecting intruders is a topic of increasing relevance in security applications. An important aspect of these ...
101
click to vote
AUSAI
2003
Springer
15 years 5 months ago
2003
Springer
Most on-line cursive handwriting recognition systems use a lexical constraint to help improve the recognition performance. Traditionally, the vocabulary lexicon is stored in a trie...