922 search results - page 53 / 185 » On a Generalization of the Stone-Weierstrass Theorem |
131
click to vote
CORR
2008
Springer
15 years 6 months 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...
173
click to vote
DM
2008
15 years 6 months 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...
155
click to vote
FROCOS
2005
Springer
15 years 11 months ago
2005
Springer
We define a general notion of a fragment within higher order type theory; a procedure for constraint satisfiability in combined fragments is outlined, following Nelson-Oppen sche...
164
click to vote
JCT
2002
15 years 5 months ago
2002
In [1], the author generalized Ehrhart's idea ([2]) of counting lattice points in dilated rational polytopes: Given a rational polytope, that is, a polytope with rational vert...
152
click to vote
ACMSE
2007
ACM
15 years 10 months ago
2007
ACM
In this paper, we present two new centralized group key management protocols based on the Chinese Remainder Theorem (CRT). By shifting more computing load onto the key server we o...