2432 search results - page 83 / 487 » Degrees and choice numbers |
173
click to vote
JGT
2008
15 years 6 months ago
2008
: This article proves the following result: Let G and G be graphs of orders n and n , respectively. Let G be obtained from G by adding to each vertex a set of n degree 1 neighbors....
162
click to vote
ICPR
2000
IEEE
16 years 7 months ago
2000
IEEE
Nowadays, every industry's goal is to improve their manufacturingprocesses and to increase their cadence of production, in order to be competitive. This goal usually implies ...
149
click to vote
ICRA
2002
IEEE
15 years 11 months ago
2002
IEEE
—Binary robotic devices with large degrees of freedom have been proposed by a number of researchers. However, experimental implementations of these concepts have been built with ...
175
click to vote
COLT
2000
Springer
15 years 10 months ago
2000
Springer
The present paper deals with the averagecase complexity of various algorithms for learning univariate polynomials. For this purpose an appropriate framework is introduced. Based o...
157
click to vote
CCCG
2010
15 years 7 months ago
2010
In this paper, we enumerate the number of combinatorial changes of the the Euclidean minimum spanning tree (EMST) of a set of n moving points in 2dimensional space. We assume that...