1499 search results - page 85 / 300 » Issues in Distance Education |
118
click to vote
CORR
2010
Springer
15 years 4 months ago
2010
Springer
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
126
click to vote
CORR
2010
Springer
15 years 4 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...
132
click to vote
CORR
2008
Springer
15 years 4 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 ...
143
click to vote
CORR
2008
Springer
15 years 4 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...
140
click to vote
CORR
2008
Springer
15 years 4 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...