We investigate the use of autonomically created small-world graphs as a framework for the long term storage of digital objects on the Web in a potentially hostile environment. We ...
In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocol...
Marcin Poturalski, Panagiotis Papadimitratos, Jean...
Advances in data collection and storage capacity have made it increasingly possible to collect highly volatile graph data for analysis. Existing graph analysis techniques are not ...
Keith Henderson, Tina Eliassi-Rad, Christos Falout...
tract: Real-time Burst Event Detection in Water Distribution Systems Seshan Srirangarajan 1 , Mudasser Iqbal 1 , Michael Allen 2 , Ami Preis 2 , Cheng Fu 1 , Lewis Girod 3 , Kai-Ju...
Seshan Srirangarajan, Mudasser Iqbal, Michael Alle...
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...