Sciweavers

386 search results - page 49 / 78
» The Weights in MDS Codes
Sort
View
IACR
2011
91views more  IACR 2011»
13 years 11 months ago
Improved Generalized Birthday Attack
Let r, B and w be positive integers. Let C be a linear code of length Bw and subspace of Fr 2. The k-regular-decoding problem is to find a nonzero codeword consisting of w length...
Paul Kirchner
ICCV
2011
IEEE
13 years 12 months ago
CARD: Compact And Real-time Descriptors
We propose Compact And Real-time Descriptors (CARD) which can be computed very rapidly and be expressed by short binary codes. An efficient algorithm based on lookup tables is pr...
Mitsuru Ambai, Yuichi Yoshida
IJCNN
2006
IEEE
15 years 5 months ago
Learning using Dynamical Regime Identification and Synchronization
—This study proposes to generalize Hebbian learning by identifying and synchronizing the dynamical regimes of individual nodes in a recurrent network. The connection weights are ...
Nicolas Brodu
ISCAS
1995
IEEE
116views Hardware» more  ISCAS 1995»
15 years 3 months ago
Capabilities and Limitations of Feedforward Neural Networks with Multilevel Neurons
This paper proposes a multilevel logic approach to output coding using multilevel neurons in the output layer. Training convergence for a single multilevel perceptron is considere...
Aleksander Malinowski, Tomasz J. Cholewo, Jacek M....
INFOCOM
2007
IEEE
15 years 6 months ago
G-3: An O(1) Time Complexity Packet Scheduler That Provides Bounded End-to-End Delay
— In this paper, we present an O(1) time-complexity packet scheduling algorithm which we call G-3 that provides bounded end-to-end delay for fixed size packet networks. G-3 is b...
Chuanxiong Guo