Sciweavers

1145 search results - page 20 / 229
» Discrete Green's Functions
Sort
View
CCA
2005
Springer
14 years 11 months ago
Computable Versions of Basic Theorems in Functional Analysis
If one wishes to find out whether a computational problem over discrete data is solvable or how complex it is, the classical approach is to represent the discrete objects in quest...
Atsushi Yoshikawa, Mariko Yasugi
ADCM
2007
119views more  ADCM 2007»
14 years 9 months ago
Causality properties of refinable functions and sequences
We show that the scale-space operators defined by a class of refinable kernels satisfy a version of the causality property, and a sequence of such operators converges to the cor...
Say Song Goh, Tim N. T. Goodman, S. L. Lee
FLAIRS
2004
14 years 11 months ago
Formation of Probabilistic Concepts through Observations Containing Discrete and Continuous Attributes
The probabilistic concept formation general problem in dealing with mixed-data scale environments is due to the use of different evaluation function for each attribute type. We cl...
Ricardo Batista Rebouças, João Jos&e...
ICIP
2003
IEEE
15 years 11 months ago
A second-order PDE technique to construct distance functions with more accurate derivatives
In this paper we demonstrate the use of an anisotropic PDE to improve the behavior of first and second derivatives of a distance function. We begin by deriving a property of these...
Siddharth Manay, Anthony J. Yezzi
ICRA
2009
IEEE
259views Robotics» more  ICRA 2009»
15 years 4 months ago
Constructing action set from basis functions for reinforcement learning of robot control
Abstract— Continuous action sets are used in many reinforcement learning (RL) applications in robot control since the control input is continuous. However, discrete action sets a...
Akihiko Yamaguchi, Jun Takamatsu, Tsukasa Ogasawar...