Sciweavers

1019 search results - page 70 / 204
» A robust randomized algorithm to perform independent tasks
Sort
View
ICDCS
2007
IEEE
15 years 10 months ago
Uniform Data Sampling from a Peer-to-Peer Network
Uniform random sample is often useful in analyzing data. Usually taking a uniform sample is not a problem if the entire data resides in one location. However, if the data is distr...
Souptik Datta, Hillol Kargupta
TC
2008
15 years 4 months ago
The Convergence-Guaranteed Random Walk and Its Applications in Peer-to-Peer Networks
Network structure construction and global state maintenance are expensive in large-scale, dynamic peer-to-peer (p2p) networks. With inherent topology independence and low state mai...
Ming Zhong, Kai Shen, Joel I. Seiferas
MCS
2010
Springer
15 years 6 months ago
Multiple Classifier Systems under Attack
Abstract. In adversarial classification tasks like spam filtering, intrusion detection in computer networks and biometric authentication, a pattern recognition system must not only...
Battista Biggio, Giorgio Fumera, Fabio Roli
JSAC
2010
138views more  JSAC 2010»
15 years 2 months ago
Dynamic conjectures in random access networks using bio-inspired learning
—Inspired by the biological entities’ ability to achieve reciprocity in the course of evolution, this paper considers a conjecture-based distributed learning approach that enab...
Yi Su, Mihaela van der Schaar
ATAL
2008
Springer
15 years 6 months ago
Multi-robot Markov random fields
We propose Markov random fields (MRFs) as a probabilistic mathematical model for unifying approaches to multi-robot coordination or, more specifically, distributed action selectio...
Jesse Butterfield, Odest Chadwicke Jenkins, Brian ...