Sciweavers

502 search results - page 92 / 101
» Streaming Random Forests
Sort
View
INFOCOM
2010
IEEE
13 years 8 months ago
RIPPLE Authentication for Network Coding
Abstract—By allowing routers to randomly mix the information content in packets before forwarding them, network coding can maximize network throughput in a distributed manner wit...
Yaping Li, Hongyi Yao, Minghua Chen, Sidharth Jagg...
MIDDLEWARE
2010
Springer
13 years 8 months ago
LiFTinG: Lightweight Freerider-Tracking in Gossip
This paper presents LiFTinG, the first protocol to detect freeriders, including colluding ones, in gossip-based content dissemination systems with asymmetric data exchanges. LiFT...
Rachid Guerraoui, Kévin Huguenin, Anne-Mari...
CORR
2011
Springer
158views Education» more  CORR 2011»
13 years 4 months ago
Polynomial Estimators for High Frequency Moments
We present an algorithm for computing Fp, the pth moment of an n-dimensional frequency vector of a data stream, for p > 2, to within 1 ± factors, ∈ (0, 1] with high constant...
Sumit Ganguly
TNN
2011
129views more  TNN 2011»
13 years 4 months ago
Minimum Complexity Echo State Network
—Reservoir computing (RC) refers to a new class of state-space models with a fixed state transition structure (the “reservoir”) and an adaptable readout form the state space...
Ali Rodan, Peter Tino
JOCN
2010
85views more  JOCN 2010»
13 years 4 months ago
Defining the Units of Competition: Influences of Perceptual Organization on Competitive Interactions in Human Visual Cortex
Multiple stimuli that are present simultaneously in the visual field compete for neural representation. At the same time, however, multiple stimuli in cluttered scenes also underg...
Stephanie A. McMains, Sabine Kastner