454 search results - page 42 / 91 » Distance Education at a Glance |
CORR
2010
Springer
14 years 9 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We propose a variant of Cauchy's Lemma, proving that when a convex chain on one sphere is redrawn (with the same lengths and angles) on a larger sphere, the distance between ...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We propose a method for statistical analysis of time series, that allows us to obtain solutions to some classical problems of mathematical statistics under the only assumption tha...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
We study randomized variants of two classical algorithms: coordinate descent for systems of linear equations and iterated projections for systems of linear inequalities. Expanding...
CORR
2008
Springer
14 years 9 months ago
2008
Springer
Guruswami and Indyk showed in [1] that Forney's error exponent can be achieved with linear coding complexity over binary symmetric channels. This paper extends this conclusion...