CORR
2007
Springer
13 years 7 months ago
2007
Springer
An edge-colored directed graph is observable if an agent that moves along its edges is able to determine his position in the graph after a sufficiently long observation of the edge...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We show that for every n > 0 there is a planar topological disk A0 and n translates A1, A2, . . . , An of A0 such that the interiors of A0, . . . An are pairwise disjoint, but ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
We consider the wavelet transform of a finite, rooted, node-ranked, p-way tree, focusing on the case of binary (p = 2) trees. We study a Haar wavelet transform on this tree. Wave...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Min, Veeravalli, and Barlas have proposed strategies to minimize the overall execution time of one or several divisible loads on a heterogeneous linear network, using one or more ...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Based on Lyndon words, a new Sudoku-like puzzle is presented and some relative theoretical questions are proposed.
CORR
2007
Springer
13 years 7 months ago
2007
Springer
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to push forward some known constructs involving relativized...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
—The capacity of the two-user Gaussian interference channel has been open for 30 years. The understanding on this problem has been limited. The best known achievable region is du...