13784 search results - page 207 / 2757 » On Computing Functions with Uncertainty |
CIE
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. This paper extends the logical approach to computable analysis via Σ–definability to higher type continuous data such as functionals and operators. We employ definab...
ENTCS
2002
13 years 9 months ago
2002
Non-deterministic computations greatly enhance the expressive power of functional logic programs, but are often computationally expensive. We analyze a programming technique that ...
CIE
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the notion of K-triviality for closed sets and continuous functions. Every K-trivial closed set contains a K-trivial real. There exists a K-trivial 0 1 class with no...
CVPR
1998
IEEE
14 years 11 months ago
1998
IEEE
Previous research has shown that aggregated predictors improve the performance of non-parametric function approximation techniques. This paper presents the results of applying agg...
SPAA
1992
ACM
14 years 1 months ago
1992
ACM
An O(log n) time, n processor randomized algorithm for computing the k-nearest neighbor graph of n points in d dimensions, for fixed d and k is presented. The method is based on t...