725 search results - page 84 / 145 » Bounding Degrees on RPL |
WCC
2005
Springer
14 years 3 months ago
2005
Springer
The security of the RSA public key cryptosystem depends on the intractability of the integer factoring problem. This paper shall give some theoretical support to the assumption of ...
FOCS
2003
IEEE
14 years 3 months ago
2003
IEEE
We study a simple Markov chain, known as the Glauber dynamics, for randomly sampling (proper) k-colorings of an input graph G on n vertices with maximum degree ∆ and girth g. We...
ICRA
2002
IEEE
14 years 2 months ago
2002
IEEE
We discuss the theoretical limitations for reconfiguration of metamorphic robots made up of Telecubes, six degree of freedom cube shaped modules currently being developed at Xerox...
IPPS
2000
IEEE
14 years 2 months ago
2000
IEEE
Abstract. The standard serial algorithm for strongly connected components is based on depth rst search, which is di cult to parallelize. We describe a divide-and-conquer algorithm ...
VMV
2004
13 years 11 months ago
2004
The compression of polygonal mesh geometry is still an active field of research as in 3d no theoretical bounds are known. This work proposes a geometry coding method based on pred...