Sciweavers

16430 search results - page 453 / 3286
» On Computable Tree Functions
Sort
View
ML
2000
ACM
154views Machine Learning» more  ML 2000»
15 years 6 months ago
Lazy Learning of Bayesian Rules
The naive Bayesian classifier provides a simple and effective approach to classifier learning, but its attribute independence assumption is often violated in the real world. A numb...
Zijian Zheng, Geoffrey I. Webb
ICCV
1998
IEEE
16 years 8 months ago
Design of Multi-Parameter Steerable Functions Using Cascade Basis Reduction
A new cascade basis reduction method of computing the optimal least-squares set of basis functions to steer a given function locally is presented. The method combines the Lie grou...
Patrick C. Teo, Yacov Hel-Or
ECCV
2000
Springer
16 years 8 months ago
Diffeomorphic Matching Problems in One Dimension: Designing and Minimizing Matching Functionals
This paper focuses on matching 1D structures by variational methods. We provide rigorous rules for the construction of the cost function, on the basis of an analysis of properties ...
Alain Trouvé, Laurent Younes
CCA
2009
Springer
16 years 1 months ago
Uniqueness, Continuity, and Existence of Implicit Functions in Constructive Analysis
We extract a quantitative variant of uniqueness from the usual hypotheses of the implicit functions theorem. This leads not only to an a priori proof of continuity, but also to an ...
Hannes Diener, Peter Schuster
CIE
2008
Springer
15 years 9 months ago
Hybrid Functional Interpretations
We show how different functional interpretations can be combined via a multi-modal linear logic. A concrete hybrid of Kreisel's modified realizability and G
Mircea-Dan Hernest, Paulo Oliva