92 search results - page 15 / 19 » Linked graphs with restricted lengths |
DLT
2006
13 years 8 months ago
2006
By weakly ambiguous (finite) transducers we mean those transducers that, although being ambiguous, may be viewed to be at arm's length from unambiguity. We define input-unambi...
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
A directed agent implies an agent with high constraints in both recognition and motion. Because of the embodied restrictions, the directed agent perceives a sense of subjective di...
DAM
2011
13 years 2 months ago
2011
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
OPODIS
2004
13 years 8 months ago
2004
S (in alphabetic order by speaker surname) Speaker: Uri Abraham (Ben-Gurion University) Title: Self-Stabilizing TimeStamps : Speaker: Anish Arora (Ohio State) Title: Self-Stabilizi...
SPAA
2012
ACM
11 years 10 months ago
2012
ACM
In this paper we study distributed algorithms on massive graphs where links represent a particular relationship between nodes (for instance, nodes may represent phone numbers and ...