Sciweavers

10608 search results - page 535 / 2122
» Complexity of O'Hara's Algorithm
Sort
View
NN
2007
Springer
112views Neural Networks» more  NN 2007»
15 years 6 months ago
An augmented CRTRL for complex-valued recurrent neural networks
Real world processes with an “intensity” and “direction” component can be made complex by convenience of representation (vector fields, radar, sonar), and their processin...
Su Lee Goh, Danilo P. Mandic
TCOM
2010
133views more  TCOM 2010»
15 years 1 months ago
Low-complexity decoding for non-binary LDPC codes in high order fields
In this paper, we propose a new implementation of the Extended Min-Sum (EMS) decoder for non-binary LDPC codes. A particularity of the new algorithm is that it takes into accounts...
Adrian Voicila, David Declercq, François Ve...
ICML
2006
IEEE
16 years 7 months ago
Agnostic active learning
We state and analyze the first active learning algorithm which works in the presence of arbitrary forms of noise. The algorithm, A2 (for Agnostic Active), relies only upon the ass...
Maria-Florina Balcan, Alina Beygelzimer, John Lang...
ICML
2005
IEEE
16 years 7 months ago
Core Vector Regression for very large regression problems
In this paper, we extend the recently proposed Core Vector Machine algorithm to the regression setting by generalizing the underlying minimum enclosing ball problem. The resultant...
Ivor W. Tsang, James T. Kwok, Kimo T. Lai
DCC
2008
IEEE
16 years 6 months ago
On solving sparse algebraic equations over finite fields
A system of algebraic equations over a finite field is called sparse if each equation depends on a small number of variables. Finding efficiently solutions to the system is an unde...
Igor Semaev