922 search results - page 175 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
JCT
2008
13 years 7 months ago
2008
A 4-graph is odd if its vertex set can be partitioned into two sets so that every edge intersects both parts in an odd number of points. Let b(n) = max n 3 + (n - ) 3 = 1 2 + o...
DM
2007
13 years 7 months ago
2007
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
JMIV
2006
13 years 7 months ago
2006
The uncertainty principle is a fundamental concept in the context of signal and image processing, just as much as it has been in the framework of physics and more recently in harmo...
JMLR
2006
13 years 7 months ago
2006
We propose a family of learning algorithms based on a new form of regularization that allows us to exploit the geometry of the marginal distribution. We focus on a semi-supervised...
ENTCS
2007
13 years 7 months ago
2007
The event B method provides a general framework for modelling both data structures and algorithms. B models are validated by discharging proof obligations ensuring safety properti...