Sciweavers

2365 search results - page 403 / 473
» All things are connected
Sort
View
ICDCN
2010
Springer
16 years 1 months ago
Authenticated Byzantine Generals in Dual Failure Model
Pease et al. introduced the problem of Byzantine Generals (BGP) to study the effects of Byzantine faults in distributed protocols for reliable broadcast. It is well known that BG...
Anuj Gupta, Prasant Gopal, Piyush Bansal, Kannan S...
WISEC
2009
ACM
16 years 1 months ago
Towards a theory for securing time synchronization in wireless sensor networks
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
Murtuza Jadliwala, Qi Duan, Shambhu J. Upadhyaya, ...
CCS
2009
ACM
16 years 1 months ago
Scalable onion routing with torsk
We introduce Torsk, a structured peer-to-peer low-latency anonymity protocol. Torsk is designed as an interoperable replacement for the relay selection and directory service of th...
Jon McLachlan, Andrew Tran, Nicholas Hopper, Yongd...
EDBT
2009
ACM
138views Database» more  EDBT 2009»
16 years 1 months ago
FOGGER: an algorithm for graph generator discovery
To our best knowledge, all existing graph pattern mining algorithms can only mine either closed, maximal or the complete set of frequent subgraphs instead of graph generators whic...
Zhiping Zeng, Jianyong Wang, Jun Zhang, Lizhu Zhou
ICDCN
2009
Springer
16 years 1 months ago
Byzantine-Resilient Convergence in Oblivious Robot Networks
Given a set of robots with arbitrary initial location and no agreement on a global coordinate system, convergence requires that all robots asymptotically approach the exact same, ...
Zohir Bouzid, Maria Gradinariu Potop-Butucaru, S&e...