On the Functional Similarity of Robust and Non-Robust Neural Representations |
|
Hiding Needles in a Haystack: Towards Constructing Neural Networks that Evade Verification |
|
Robust Classification Combined with Robust out-of-Distribution Detection: An Empirical Analysis |
|
Adversarial Robustness of Model Sets |
|
Modeling Peer-to-Peer Connections over a Smartphone Network |
|
Decentralized machine learning using compressed push-pull averaging |
|
Attacking model sets with adversarial examples |
|
Adversarial robustness of linear models: Regularization and dimensionality |
|
Gossip learning as a decentralized alternative to federated learning |
|
Stunner: A smart phone trace for developing decentralized edge systems |
|
Token account algorithms: The best of the proactive and reactive worlds |
|
Decentralized Management of Random Walks over a Mobile Phone Network |
|
Distributed Differentially Private Stochastic Gradient Descent: An Empirical Study |
|
Dimension Reduction Methods for Collaborative Mobile Gossip Learning |
|
Building a secure and privacy-preserving smart grid |
|
Distributional differential privacy for large-scale smart metering |
|
Defining and understanding smartphone churn over the internet: A measurement study |
|
Fully Distributed Robust Singular Value Decomposition |
|
JA-BE-JA: A Distributed Algorithm for Balanced Graph Partitioning |
|
Through the wormhole: Low cost, fresh peer sampling for the Internet |
|
Gossip-based distributed stochastic bandit algorithms |
|
Gossip-based learning under drifting concepts in fully distributed networks |
|
Peer-to-Peer Multi-class Boosting |
|
Asynchronous Peer-to-Peer Data Mining with Stochastic Gradient Descent |
|
Modeling network-level impacts of P2P flows |
|
Modeling unconnectable peers in private bittorrent communities |
|
Message from the program co-chairs |
|
Towards inferring ratings from user behavior in BitTorrent communities |
|
Message from the general chairs |
|
Overlay Management for Fully Distributed User-Based Collaborative Filtering |
|
Message from the Workshop Chairs: QTESO 2010 |
|
Novel balanced feature representation for wikipedia vandalism detection task: Lab report for PAN at CLEF 2010 |
|
Distributed hyper-heuristics for real parameter optimization |
|
Scalable P2P Overlays of Very Small Constant Degree: An Emerging Security Threat |
|
PeerSim: A Scalable P2P Simulator |
|
Adaptive Peer Sampling with Newscast |
|
Towards automated detection of peer-to-peer botnets: On the limits of local approaches |
|
T-MAN: Gossip-based fast overlay topology construction |
|
Decentralized ranking in large-scale overlay networks |
|
Firefly-inspired heartbeat synchronization in overlay networks |
|
Editorial by the program committee co-chairs |
|
Asynchronous distributed power iteration with gossip-based normalization |
|
Exploring the interdisciplinary connections of gossip-based systems |
|
Managing clouds: A case for a fresh look at large unreliable dynamic networks |
|
The bootstrapping service |
|
Ordered slicing of very large-scale overlay networks |
|
T-man: Gossip-based overlay topology management |
|
Engineering emergence through gossip |
|
Chord on demand |
|
Grassroots approach to self-management in large-scale distributed systems |
|
Topic 15 - Peer-to-peer and web computing |
|
An approach to massively distributed aggregate computing on peer-to-peer networks |
|
Epidemic-style Proactive aggregation in large overlay networks |
|
A modular paradigm for building self-organizing peer-to-peer applications |
|
The peer sampling service: Experimental evaluation of unstructured gossip-based implementations |
|
A robust and scalable peer-to-peer gossiping protocol |
|
Robust aggregation protocols for large-scale overlay networks |
|
Maintaining connectivity in a scalable and robust distributed environment |
|
A scalable and robust framework for distributed applications |
|
A critical note on experimental research methodology in EC |
|
The adaptationist stance and evolutionary computation |
|
Characterizations of trajectory structure of fitness landscapes based on pairwise transition probabilities of solutions |
|
Gas, an approach to a solution of the niche radius problem |
|