2924 search results - page 415 / 585 » Lower Bounds in Distributed Computing |
162
click to vote
FOCS
1990
IEEE
15 years 10 months ago
1990
IEEE
We present three alternative simple constructions of small probability spaces on n bits for which any k bits are almost independent. The number of bits used to specify a point in ...
190
click to vote
CONCUR
2008
Springer
15 years 8 months ago
2008
Springer
R-automata are finite state machines extended with counters which can be incremented or reset to zero along the transitions. The universality question asks whether there is a cons...
161
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
We study decision problems for parameterized verification of a formal model of Ad Hoc Networks with selective broadcast and spontaneous movement. The communication topology of a ne...
149
click to vote
PVM
2010
Springer
15 years 4 months ago
2010
Springer
MPI datatypes are a convenient abstraction for manipulating complex data structures and are useful in a number of contexts. In some cases, these descriptions need to be preserved o...
153
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we address the problem of the sensor placement for estimating the direction of a narrow-band source, randomly located in the far-field of a planar antenna array. E...