Sciweavers

244 search results - page 11 / 49
» Analyzing the performance of randomized information sharing
Sort
View
P2P
2010
IEEE
207views Communications» more  P2P 2010»
13 years 6 months ago
Local Access to Sparse and Large Global Information in P2P Networks: A Case for Compressive Sensing
—In this paper we face the following problem: how to provide each peer local access to the full information (not just a summary) that is distributed over all edges of an overlay ...
Rossano Gaeta, Marco Grangetto, Matteo Sereno
ECCV
2008
Springer
14 years 9 months ago
A Dynamic Conditional Random Field Model for Joint Labeling of Object and Scene Classes
Object detection and pixel-wise scene labeling have both been active research areas in recent years and impressive results have been reported for both tasks separately. The integra...
Christian Wojek, Bernt Schiele
CCR
2010
133views more  CCR 2010»
13 years 7 months ago
The role of network trace anonymization under attack
In recent years, academic literature has analyzed many attacks on network trace anonymization techniques. These attacks usually correlate external information with anonymized data...
Martin Burkhart, Dominik Schatzmann, Brian Trammel...
ICDCSW
2009
IEEE
14 years 2 months ago
Performance Tradeoffs Among Percolation-Based Broadcast Protocols in Wireless Sensor Networks
Broadcast of information in wireless sensor networks is an important operation, e.g., for code updates, queries, membership information, etc. In this paper, we analyze and experim...
Vijay Raman, Indranil Gupta
WSC
2004
13 years 9 months ago
A Case Study in Meta-Simulation Design and Performance Analysis for Large-Scale Networks
Simulation and Emulation techniques are fundamental to aid the process of large-scale protocol design and network operations. However, the results from these techniques are often ...
David W. Bauer, Garrett R. Yaun, Christopher D. Ca...