Sciweavers

3708 search results - page 363 / 742
» Approximating Betweenness Centrality
Sort
View
MOBIHOC
2008
ACM
16 years 6 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
MOBIHOC
2007
ACM
16 years 6 months ago
Scalable routing in delay tolerant networks
The non-existence of an end-to-end path poses a challenge in adapting the traditional routing algorithms to delay tolerant networks (DTNs). Previous works include centralized rout...
Cong Liu, Jie Wu
MOBIHOC
2003
ACM
16 years 6 months ago
Connected sensor cover: self-organization of sensor networks for efficient query execution
Spatial query execution is an essential functionality of a sensor network, where a query gathers sensor data within a specific geographic region. Redundancy within a sensor networ...
Himanshu Gupta, Samir R. Das, Quinyi Gu
201
Voted
ALT
2003
Springer
16 years 3 months ago
On the Existence and Convergence of Computable Universal Priors
Solomonoff unified Occam’s razor and Epicurus’ principle of multiple explanations to one elegant, formal, universal theory of inductive inference, which initiated the field...
Marcus Hutter
IPSN
2010
Springer
16 years 1 months ago
Online distributed sensor selection
A key problem in sensor networks is to decide which sensors to query when, in order to obtain the most useful information (e.g., for performing accurate prediction), subject to co...
Daniel Golovin, Matthew Faulkner, Andreas Krause