511 search results - page 93 / 103 » Lower bounds for distributed markov chain problems |
ICDE
2007
IEEE
14 years 9 months ago
2007
IEEE
For location-based services it is often essential to efficiently process proximity relations among mobile objects, such as to establish whether a group of friends or family member...
MOBIHOC
2006
ACM
14 years 7 months ago
2006
ACM
Existing multi-channel protocols have been demonstrated to significantly increase aggregate throughput compared to single-channel protocols. However, we show that despite such imp...
ICC
2008
IEEE
14 years 2 months ago
2008
IEEE
—In battery-constrained large-scale sensor networks, nodes are prone to random failures due to various reasons, such as energy depletion and hostile environment. Random failures ...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
Binary search trees are one of the most fundamental data structures. While the height of such a tree may be linear in the worst case, the average height with respect to the uniform...
GLOBECOM
2009
IEEE
13 years 5 months ago
2009
IEEE
How to rapidly disseminate a large-sized file to many recipients is a fundamental problem in many applications, such as updating software patches and distributing large scientific ...