Sciweavers

1941 search results - page 79 / 389
» On the Hardness of Approximate Reasoning
Sort
View
MOC
2002
72views more  MOC 2002»
14 years 11 months ago
Long-term stability of variable stepsize approximations of semigroups
This paper is concerned with the stability of rational one-step approximations of C0 semigroups. Particular emphasis is laid on long-term stability bounds. The analysis is based on...
Nikolai Bakaev, Alexander Ostermann
JMLR
2010
129views more  JMLR 2010»
14 years 6 months ago
Approximation of hidden Markov models by mixtures of experts with application to particle filtering
Selecting conveniently the proposal kernel and the adjustment multiplier weights of the auxiliary particle filter may increase significantly the accuracy and computational efficie...
Jimmy Olsson, Jonas Ströjby
ICADL
2003
Springer
149views Education» more  ICADL 2003»
15 years 5 months ago
Approximating Fair Use in LicenseScript
Current rights management systems are not able to enforce copyright laws because of both legal and technological reasons. The contract rights granted by a copyright owner are often...
Cheun Ngen Chong, Sandro Etalle, Pieter H. Hartel,...
ILP
1999
Springer
15 years 4 months ago
Approximate ILP Rules by Backpropagation Neural Network: A Result on Thai Character Recognition
This paper presents an application of Inductive Logic Programming (ILP) and Backpropagation Neural Network (BNN) to the problem of Thai character recognition. In such a learning pr...
Boonserm Kijsirikul, Sukree Sinthupinyo
PLILP
1993
Springer
15 years 4 months ago
Narrowing Approximations as an Optimization for Equational Logic Programs
Abstract. Solving equations in equational theories is a relevant programming paradigm which integrates logic and equational programming into one unified framework. Efficient metho...
María Alpuente, Moreno Falaschi, Marí...