4324 search results - page 54 / 865 » A Generalized Representer Theorem |
113
click to vote
JAR
2000
15 years 17 days ago
2000
We report our effort to build a geometry deductive database, which can be used to find the fixpoint for a geometric configuration. The system can find all the properties of the con...
98
Voted
IGPL
1998
15 years 13 days ago
1998
Is it possible to compute in which logics a given formula is deducible? The aim of this paper is to provide a formal basis to answer positively this question in the context of sub...
123
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Schaefer's theorem is a complexity classification result for so-called Boolean constraint satisfaction problems: it states that every Boolean constraint satisfaction problem ...
80
Voted
CORR
2008
Springer
15 years 26 days ago
2008
Springer
This paper concerns the capacity of the discrete noiseless channel introduced by Shannon. A sufficient condition is given for the capacity to be well-defined. For a general discre...
111
Voted
DM
2008
15 years 25 days ago
2008
One of the basic results in graph theory is Dirac's theorem, that every graph of order n 3 and minimum degree n/2 is Hamiltonian. This may be restated as: if a graph of ord...