Sciweavers

3670 search results - page 186 / 734
» Linear Recursive Functions
Sort
View
MST
2006
105views more  MST 2006»
15 years 6 months ago
Selection Functions that Do Not Preserve Normality
The sequence selected from a sequence R(0)R(1) . . . by a language L is the subsequence of R that contains exactly the bits R(n + 1) such that the prefix R(0) . . . R(n) is in L. B...
Wolfgang Merkle, Jan Reimann
NN
2010
Springer
187views Neural Networks» more  NN 2010»
15 years 1 months ago
Efficient exploration through active learning for value function approximation in reinforcement learning
Appropriately designing sampling policies is highly important for obtaining better control policies in reinforcement learning. In this paper, we first show that the least-squares ...
Takayuki Akiyama, Hirotaka Hachiya, Masashi Sugiya...
TNN
2010
216views Management» more  TNN 2010»
15 years 29 days ago
Simplifying mixture models through function approximation
Finite mixture model is a powerful tool in many statistical learning problems. In this paper, we propose a general, structure-preserving approach to reduce its model complexity, w...
Kai Zhang, James T. Kwok
WINE
2005
Springer
206views Economy» more  WINE 2005»
15 years 11 months ago
Exchange Market Equilibria with Leontief's Utility: Freedom of Pricing Leads to Rationality
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
Yinyu Ye
CORR
2010
Springer
101views Education» more  CORR 2010»
15 years 5 months ago
Circuits with arbitrary gates for random operators
We consider boolean circuits computing n-operators f : {0, 1}n {0, 1}n . As gates we allow arbitrary boolean functions; neither fanin nor fanout of gates is restricted. An operat...
Stasys Jukna, Georg Schnitger