Sciweavers

818 search results - page 131 / 164
» Network bargaining: algorithms and structural results
Sort
View
CORR
2010
Springer
79views Education» more  CORR 2010»
13 years 7 months ago
A Multi-hop Multi-source Algebraic Watchdog
In our previous work (`An Algebraic Watchdog for Wireless Network Coding'), we proposed a new scheme in which nodes can detect malicious behaviors probabilistically, police th...
MinJi Kim, Muriel Médard, João Barro...
SAC
2009
ACM
14 years 2 months ago
Visualization of clustered directed acyclic graphs with node interleaving
Graph drawing and visualization represent structural information ams of abstract graphs and networks. An important subset of graphs is directed acyclic graphs (DAGs). E-Spring alg...
Pushpa Kumar, Kang Zhang
EDBT
2008
ACM
122views Database» more  EDBT 2008»
14 years 8 months ago
Semantic peer, here are the neighbors you want!
Peer Data Management Systems (PDMSs) have been introduced as a solution to the problem of large-scale sharing of semantically rich data. A PDMS consists of semantic peers connecte...
Wilma Penzo, Stefano Lodi, Federica Mandreoli, Ric...
CCS
2009
ACM
14 years 2 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...
SIGMOD
2010
ACM
260views Database» more  SIGMOD 2010»
14 years 18 days ago
Towards proximity pattern mining in large graphs
Mining graph patterns in large networks is critical to a variety of applications such as malware detection and biological module discovery. However, frequent subgraphs are often i...
Arijit Khan, Xifeng Yan, Kun-Lung Wu