Sciweavers

2938 search results - page 180 / 588
» On obfuscating point functions
Sort
View
NPL
2006
82views more  NPL 2006»
15 years 6 months ago
How Online Learning Approaches Ornstein Uhlenbeck Processes
We show that under reasonable conditions, online learning for a nonlinear function near a local minimum is similar to a multivariate Ornstein Uhlenbeck process. This implies that ...
Fredrik A. Dahl
AML
2004
90views more  AML 2004»
15 years 6 months ago
A comparison of two systems of ordinal notations
The standard method of generating countable ordinals from uncountable ordinals can be replaced by a use of fixed point extractors available in the term calculus of Howard's s...
Harold Simmons
CG
2004
Springer
15 years 6 months ago
Views of Fibonacci dynamics
The Binet formula gives a natural way for Fibonacci numbers to be viewed as a function of a complex variable. We experimentally study the complex dynamics of the Fibonacci numbers...
Clifford A. Reiter
SIGPRO
2002
63views more  SIGPRO 2002»
15 years 6 months ago
Adding data process feedback to the nonlinear autoregressive model
A nonlinear autoregressive model, the process feedback nonlinear autoregressive (PFNAR) model, in which the autoregressive coe cients are a function of the combination of past dat...
Hiroko Kato, Tohru Ozaki
ICCV
2007
IEEE
16 years 8 months ago
Semi-supervised Discriminant Analysis
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. The projection vectors are commonly obtained by maximizing ...
Deng Cai, Xiaofei He, Jiawei Han