Sciweavers

654 search results - page 115 / 131
» An efficient approximation algorithm for the survivable netw...
Sort
View
IMC
2010
ACM
13 years 5 months ago
Measuring the mixing time of social graphs
Social networks provide interesting algorithmic properties that can be used to bootstrap the security of distributed systems. For example, it is widely believed that social networ...
Abedelaziz Mohaisen, Aaram Yun, Yongdae Kim
DAC
2002
ACM
14 years 8 months ago
Schedulability of event-driven code blocks in real-time embedded systems
Many real-time embedded systems involve a collection of independently executing event-driven code blocks, having hard real-time constraints. Tasks in many such systems, like netwo...
Samarjit Chakraborty, Thomas Erlebach, Simon K&uum...
PODS
2007
ACM
225views Database» more  PODS 2007»
14 years 7 months ago
Sketching unaggregated data streams for subpopulation-size queries
IP packet streams consist of multiple interleaving IP flows. Statistical summaries of these streams, collected for different measurement periods, are used for characterization of ...
Edith Cohen, Nick G. Duffield, Haim Kaplan, Carste...
DAC
2002
ACM
14 years 8 months ago
Constraint-driven communication synthesis
Constraint-driven Communication Synthesis enables the automatic design of the communication architecture of a complex system from a library of pre-defined Intellectual Property (I...
Alessandro Pinto, Luca P. Carloni, Alberto L. Sang...
KDD
2010
ACM
300views Data Mining» more  KDD 2010»
13 years 6 months ago
Using data mining techniques to address critical information exchange needs in disaster affected public-private networks
Crisis Management and Disaster Recovery have gained immense importance in the wake of recent man and nature inflicted calamities. A critical problem in a crisis situation is how t...
Li Zheng, Chao Shen, Liang Tang, Tao Li, Steven Lu...