302 search results - page 6 / 61 » Asymptotic performance of distributed detection over random ... |
COMSWARE
2008
IEEE
14 years 1 months ago
2008
IEEE
—The poor performance of TCP over multi-hop wireless networks is well known. In this paper we explore to what extent network coding can help to improve the throughput performance...
UAI
2008
13 years 8 months ago
2008
Numerous temporal inference tasks such as fault monitoring and anomaly detection exhibit a persistence property: for example, if something breaks, it stays broken until an interve...
GLOBECOM
2006
IEEE
14 years 1 months ago
2006
IEEE
— Sensing coverage is an important issue for sensor networks, since it is viewed as one of the critical measures of performance offered by a sensor network. The design of a routi...
IPL
2002
13 years 7 months ago
2002
Splay trees are self-organizing binary search trees that were introduced by Sleator and Tarjan [12]. In this paper we present a randomized variant of these trees. The new algorith...
TSP
2010
13 years 2 months ago
2010
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...