Sciweavers

1513 search results - page 134 / 303
» Fibonacci Correction Networks
Sort
View
CORR
2010
Springer
105views Education» more  CORR 2010»
15 years 1 months ago
Universal and Robust Distributed Network Codes
Random linear network codes can be designed and implemented in a distributed manner, with low computational complexity. However, these codes are classically implemented [1] over fi...
Tracey Ho, Sidharth Jaggi, Svitlana Vyetrenko, Lin...
DSN
2009
IEEE
16 years 24 days ago
Fail-Aware Untrusted Storage
We consider a set of clients collaborating through an online service provider that is subject to attacks, and hence y trusted by the clients. We introduce the abstraction of a fai...
Christian Cachin, Idit Keidar, Alexander Shraer
GLOBECOM
2008
IEEE
16 years 15 days ago
Maximizing Transport Capacity for Geographic Transmission on Nakagami-m Channels
—In mobile ad hoc networks (MANETs), conventional packet forwarding schemes that pre-select the next-hop receivers for a packet may fail if the channel coherence time is on the o...
Tathagata D. Goswami, John M. Shea, Tan F. Wong, M...
WCNC
2008
IEEE
16 years 13 days ago
Genetic Algorithm Aided Design of Near-Capacity Irregular Variable Length Codes
— In this paper we demonstrate that our ability to match the EXtrinsic Information Transfer (EXIT) function of an Irregular Variable Length Code (IrVLC) to that of a seriallyconc...
Robert G. Maunder, Lajos Hanzo
IJCNN
2007
IEEE
16 years 11 days ago
Analyzing the Fuzzy ARTMAP Matchtracking mechanism with Co-Objective Optimization Theory
— In the process of learning a pattern I, the Fuzzy ARTMAP algorithm templates (i.e., the weight vectors corresponding to nodes of its category representation layer) compete for ...
José Castro, Michael Georgiopoulos, Jimmy S...