922 search results - page 88 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
161
click to vote
MSCS
2006
15 years 6 months ago
2006
Abstract. In the paper we introduce and study the uniform regular enumerations for arbitrary recursive ordinals. As an application of the technique we obtain a uniform generalizati...
158
click to vote
ICML
2004
IEEE
16 years 7 months ago
2004
IEEE
In this paper we show that many kernel methods can be adapted to deal with indefinite kernels, that is, kernels which are not positive semidefinite. They do not satisfy Mercer...
147
click to vote
ISSAC
2009
Springer
16 years 27 days ago
2009
Springer
In this work we relate the deterministic complexity of factoring polynomials (over finite fields) to certain combinatorial objects, we call m-schemes, that are generalizations o...
152
click to vote
FOSSACS
2010
Springer
16 years 25 days ago
2010
Springer
Abstract. Spatial logics have been introduced to reason about distributed computation in models for concurrency. We first define a spatial logic for a general class of infinite-...
141
click to vote
ASIACRYPT
2007
Springer
16 years 15 days ago
2007
Springer
Abstract. In the standard general-adversary model for multi-party protocols, a global adversary structure is given, and every party must trust in this particular structure. We intr...