Sciweavers

7106 search results - page 53 / 1422
» Restricted Complexity, General Complexity
Sort
View
AML
1998
60views more  AML 1998»
13 years 7 months ago
A restricted computation model on Scott domains and its partial primitive recursive functionals
The paper builds on both a simply typed term system PRω and a computation model on Scott domains via so-called parallel typed while programs (PTWP). The former provides a notion ...
Karl-Heinz Niggl
AI
2008
Springer
13 years 7 months ago
What makes propositional abduction tractable
Abduction is a fundamental form of nonmonotonic reasoning that aims at finding explanations for observed manifestations. This process underlies many applications, from car configu...
Gustav Nordh, Bruno Zanuttini
NECO
2010
97views more  NECO 2010»
13 years 6 months ago
Rademacher Chaos Complexities for Learning the Kernel Problem
In this paper we develop a novel generalization bound for learning the kernel problem. First, we show that the generalization analysis of the kernel learning problem reduces to in...
Yiming Ying, Colin Campbell
ENDM
2010
87views more  ENDM 2010»
13 years 7 months ago
Euler Complexes (Oiks)
We present a class of instances of the existence of a second object of a specified type, in fact, of an even number of objects of a specified type, which generalizes the existence...
Jack Edmonds
JAT
2010
61views more  JAT 2010»
13 years 6 months ago
Multivariate complex B-splines and Dirichlet averages
Abstract. The notion of complex B-spline is extended to a multivariate setting by means of ridge functions employing the known geometric relationship between ordinary B-splines and...
Peter Massopust, Brigitte Forster