Sciweavers

10054 search results - page 207 / 2011
» On the Complexity of Function Learning
Sort
View
ICA
2004
Springer
15 years 6 months ago
ICA Using Kernel Entropy Estimation with NlogN Complexity
Abstract. Mutual information (MI) is a common criterion in independent component analysis (ICA) optimization. MI is derived from probability density functions (PDF). There are scen...
Sarit Shwartz, Michael Zibulevsky, Yoav Y. Schechn...
ECTEL
2006
Springer
15 years 4 months ago
Context-Aware Workplace Learning Support: Concept, Experiences, and Remaining Challenges
Workplace learning offers the unique possibility of the immediacy of purpose and real-world context. In order to leverage on this, we have developed a context-aware method to suppo...
Andreas Schmidt, Simone Braun
107
Voted
NIPS
1994
15 years 2 months ago
Learning to Play the Game of Chess
This paper presents NeuroChess, a program which learns to play chess from the final outcome of games. NeuroChess learns chess board evaluation functions, represented by artificial...
Sebastian Thrun
108
Voted
ICIP
2002
IEEE
16 years 2 months ago
Satellite and aerial image deconvolution using an EM method with complex wavelets
In this paper, we present a new deconvolution method, able to deal with noninvertible blurring functions. To avoid noise amplification, a prior model of the image to be reconstruc...
André Jalobeanu, Josiane Zerubia, Má...
118
Voted
STOC
2004
ACM
153views Algorithms» more  STOC 2004»
16 years 1 months ago
Quantum and classical query complexities of local search are polynomially related
Let f be an integer valued function on a finite set V . We call an undirected graph G(V, E) a neighborhood structure for f. The problem of finding a local minimum for f can be phr...
Miklos Santha, Mario Szegedy