16 search results - page 2 / 4 » cocoon 2004 |
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
COCOON
2004
Springer
13 years 8 months ago
2004
Springer
In this paper we introduce a notion of a regular expression over infinite alphabets and show that a language is definable by an infinite alphabet regular expression if and only if ...
COCOON
2004
Springer
13 years 10 months ago
2004
Springer
This paper studies the on-demand broadcasting problem with deadlines. We give the first general upper bound and improve existing lower bounds on the com
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
Abstract. An undirected graph G = (V, E) is the k-power of an undirected tree T = (V, E ) if (u, v) ∈ E iff u and v are connected by a path of length at most k in T. The tree T ...