614 search results - page 95 / 123 » Local Computation: Lower and Upper Bounds |
DAM
2011
13 years 4 months ago
2011
An arc of a graph is an oriented edge and a 3-arc is a 4-tuple (v, u, x, y) of vertices such that both (v, u, x) and (u, x, y) are paths of length two. The 3-arc graph of a graph ...
AFL
2011
12 years 9 months ago
2011
In this paper, we propose a new variant of Accepting Networks of Evolutionary Processors, in which the operations can be applied only arbitrarily to the words, while the filters ...
TSMC
2010
13 years 4 months ago
2010
We study the problem of projecting high-dimensional tensor data on an unspecified Riemannian manifold onto some lower dimensional subspace1 without much distorting the pairwise geo...
QEST
2008
IEEE
14 years 4 months ago
2008
IEEE
We begin by observing that (discrete-time) QuasiBirth-Death Processes (QBDs) are equivalent, in a precise sense, to (discrete-time) probabilistic 1-Counter Automata (p1CAs), and b...
OPODIS
2010
13 years 7 months ago
2010
Abstract. Shared counters are the key to solving a variety of coordination problems on multiprocessor machines, such as barrier synchronization and index distribution. It is desire...