Sciweavers

3038 search results - page 224 / 608
» High-Speed Function Approximation
Sort
View
ECSQARU
2005
Springer
16 years 1 days ago
Nonlinear Deterministic Relationships in Bayesian Networks
In a Bayesian network with continuous variables containing a variable(s) that is a conditionally deterministic function of its continuous parents, the joint density function for t...
Barry R. Cobb, Prakash P. Shenoy
JMLR
2006
150views more  JMLR 2006»
15 years 6 months ago
Building Support Vector Machines with Reduced Classifier Complexity
Support vector machines (SVMs), though accurate, are not preferred in applications requiring great classification speed, due to the number of support vectors being large. To overc...
S. Sathiya Keerthi, Olivier Chapelle, Dennis DeCos...
CJ
2004
90views more  CJ 2004»
15 years 6 months ago
Extended k-Nearest Neighbours based on Evidence Theory
An evidence theoretic classification method is proposed in this paper. In order to classify a pattern we consider its neighbours, which are taken as parts of a single source of ev...
Hui Wang, David A. Bell
ML
2002
ACM
168views Machine Learning» more  ML 2002»
15 years 6 months ago
On Average Versus Discounted Reward Temporal-Difference Learning
We provide an analytical comparison between discounted and average reward temporal-difference (TD) learning with linearly parameterized approximations. We first consider the asympt...
John N. Tsitsiklis, Benjamin Van Roy
COCOON
2009
Springer
16 years 1 months ago
On the Readability of Monotone Boolean Formulae
Golumbic et al. [Discrete Applied Mathematics 154(2006) 1465-1477] defined the readability of a monotone Boolean function f to be the minimum integer k such that there exists an ...
Khaled M. Elbassioni, Kazuhisa Makino, Imran Rauf