Sciweavers

3809 search results - page 135 / 762
» Randomized Broadcast in Networks
Sort
View
TON
2002
175views more  TON 2002»
13 years 7 months ago
Compressed bloom filters
A Bloom filter is a simple space-efficient randomized data structure for representing a set in order to support membership queries. Although Bloom filters allow false positives, f...
Michael Mitzenmacher
JMLR
2010
160views more  JMLR 2010»
13 years 3 months ago
Neural conditional random fields
We propose a non-linear graphical model for structured prediction. It combines the power of deep neural networks to extract high level features with the graphical framework of Mar...
Trinh Minh Tri Do, Thierry Artières
NCA
2006
IEEE
14 years 2 months ago
SecLEACH - A Random Key Distribution Solution for Securing Clustered Sensor Networks
Clustered sensor networks have been shown to increase system throughput, decrease system delay, and save energy. While those with rotating cluster heads, such as LEACH, have also ...
Leonardo B. Oliveira, Hao Chi Wong, Marshall W. Be...
STOC
2004
ACM
138views Algorithms» more  STOC 2004»
14 years 1 months ago
Know thy neighbor's neighbor: the power of lookahead in randomized P2P networks
Several peer-to-peer networks are based upon randomized graph topologies that permit efficient greedy routing, e.g., randomized hypercubes, randomized Chord, skip-graphs and const...
Gurmeet Singh Manku, Moni Naor, Udi Wieder
ISCAS
2005
IEEE
97views Hardware» more  ISCAS 2005»
14 years 1 months ago
Two-level decoupled Hamming network for associative memory under noisy environment
— Compared with a single level Hamming associative memory, a simple model based on uniform random noise analysis has proved a twolevel decoupled Hamming network to be an efficie...
Liang Chen, Naoyuki Tokuda, Akira Nagai