451 search results - page 44 / 91 » Some Lower Bounds on Geometric Separability Problems |
SG
2005
Springer
15 years 3 months ago
2005
Springer
This paper presents a smart algorithm for labeling column charts and their derivatives. To efficiently solve the problem, we separate it into two sub-problems. We first present a ...
108
click to vote
TC
2002
14 years 9 months ago
2002
We investigate whether asynchronous computational models and asynchronous algorithms can be considered for designing real-time distributed fault-tolerant systems. A priori, the lac...
PODC
2009
ACM
15 years 6 months ago
2009
ACM
In this paper, we study the wireless synchronization problem which requires devices activated at different times on a congested single-hop radio network to synchronize their roun...
WDAG
2010
Springer
14 years 8 months ago
2010
Springer
We show that the asymptotic gain in the time complexity when using collision detection depends heavily on the task by investigating three prominent problems for wireless networks,...
GC
2006
Springer
14 years 9 months ago
2006
Springer
We give a bound on the reconstructibility of an action G X in terms of the reconstructibility of a the action N X, where N is a normal subgroup of G, and the reconstructibility o...