Sciweavers

4255 search results - page 398 / 851
» On Learning Boolean Functions
Sort
View
ADCM
2007
114views more  ADCM 2007»
15 years 6 months ago
Convergence analysis of online algorithms
In this paper, we are interested in the analysis of regularized online algorithms associated with reproducing kernel Hilbert spaces. General conditions on the loss function and st...
Yiming Ying
CORR
2010
Springer
253views Education» more  CORR 2010»
15 years 6 months ago
Fast Inference in Sparse Coding Algorithms with Applications to Object Recognition
Adaptive sparse coding methods learn a possibly overcomplete set of basis functions, such that natural image patches can be reconstructed by linearly combining a small subset of t...
Koray Kavukcuoglu, Marc'Aurelio Ranzato, Yann LeCu...
COLT
2010
Springer
15 years 4 months ago
Deterministic Sparse Fourier Approximation via Fooling Arithmetic Progressions
A significant Fourier transform (SFT) algorithm, given a threshold and oracle access to a function f, outputs (the frequencies and approximate values of) all the -significant Fou...
Adi Akavia
HAIS
2009
Springer
15 years 4 months ago
A Three-Objective Evolutionary Approach to Generate Mamdani Fuzzy Rule-Based Systems
Abstract. In the last years, several papers have proposed to adopt multiobjective evolutionary algorithms (MOEAs) to generate Mamdani fuzzy rulebased systems with different trade-o...
Michela Antonelli, Pietro Ducange, Beatrice Lazzer...
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
15 years 1 months ago
Evolution of the perception about the opponent in hypergames
This paper studies the evolution of the perceptions of players about the game they are involved in using the framework of hypergame theory. The focus is on developing methods that ...
Bahman Gharesifard, Jorge Cortes