Sciweavers

82 search results - page 7 / 17
» Information dissemination in highly dynamic graphs
Sort
View
CC
2007
Springer
14 years 2 months ago
Correcting the Dynamic Call Graph Using Control-Flow Constraints
Abstract. To reason about programs, dynamic optimizers and analysis tools use sampling to collect a dynamic call graph (DCG). However, sampling has not achieved high accuracy with ...
Byeongcheol Lee, Kevin Resnick, Michael D. Bond, K...
PE
2008
Springer
108views Optimization» more  PE 2008»
13 years 8 months ago
Rate-optimal schemes for Peer-to-Peer live streaming
In this paper we consider the problem of sending data in real time from information sources to sets of receivers, using peer-to-peer communications. We consider several models of ...
Laurent Massoulié, Andrew Twigg
BROADNETS
2007
IEEE
14 years 3 months ago
Computer worm ecology in encounter-based networks
Abstract— Encounter-based network is a frequentlydisconnected wireless ad-hoc network requiring immediate neighbors to store and forward aggregated data for information dissemina...
Sapon Tanachaiwiwat, Ahmed Helmy
SACMAT
2009
ACM
14 years 3 months ago
A decision support system for secure information sharing
In both the commercial and defense sectors a compelling need is emerging for highly dynamic, yet risk optimized, sharing of information across traditional organizational boundarie...
Achille Fokoue, Mudhakar Srivatsa, Pankaj Rohatgi,...
APVIS
2010
13 years 6 months ago
Interactive local clustering operations for high dimensional data in parallel coordinates
In this paper, we propose an approach of clustering data in parallel coordinates through interactive local operations. Different from many other methods in which clustering is glo...
Peihong Guo, He Xiao, Zuchao Wang, Xiaoru Yuan