Sciweavers

7920 search results - page 1535 / 1584
» The Swarm Application Framework
Sort
View
HT
2010
ACM
14 years 12 months ago
Analysis of graphs for digital preservation suitability
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 ...
Charles L. Cartledge, Michael L. Nelson
CCS
2008
ACM
14 years 12 months ago
Towards provable secure neighbor discovery in wireless networks
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...
KDD
2010
ACM
247views Data Mining» more  KDD 2010»
14 years 12 months ago
Metric forensics: a multi-level approach for mining volatile graphs
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...
IPSN
2010
Springer
14 years 12 months ago
Real-time burst event detection in water distribution systems
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...
COCOA
2008
Springer
14 years 11 months ago
Elementary Approximation Algorithms for Prize Collecting Steiner Tree Problems
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...
Shai Gutner
« Prev « First page 1535 / 1584 Last » Next »