227 search results - page 16 / 46 » Rough Set Methods in Approximation of Hierarchical Concepts |
VISSYM
2003
13 years 9 months ago
2003
We present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement an...
BIRTHDAY
2005
Springer
14 years 1 months ago
2005
Springer
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
SIGMOD
2010
ACM
13 years 7 months ago
2010
ACM
Histograms have been widely used for fast estimation of query result sizes in query optimization. In this paper, we propose a new histogram method, called the Skew-Tolerant Histog...
IPPS
2007
IEEE
14 years 2 months ago
2007
IEEE
Applications such as parallel computing, online games, and content distribution networks need to run on a set of resources with particular network connection characteristics to ge...
IJON
1998
13 years 7 months ago
1998
The method presented here is aimed to a direct fast setting of the parameters of a RBF network for function approximation. It is based on a hierarchical gridding of the input spac...