Sciweavers

1055 search results - page 23 / 211
» order 2002
Sort
View
70
Voted
CAGD
2002
69views more  CAGD 2002»
14 years 10 months ago
Adjusting control points to achieve continuity
In this paper, I discuss a method for increasing the continuity between two functional triangular polynomial patches by adjusting their control points. The method described in thi...
Stephen Mann
AAECC
2002
Springer
98views Algorithms» more  AAECC 2002»
14 years 10 months ago
A Polynomial Representation of the Diffie-Hellman Mapping
Let Fq be the finite field of order q and be an element of Fq of order d. The construction of an explicit polynomial f (X) Fq[X] of degree d - 1 with the property f i = i2 for ...
Wilfried Meidl, Arne Winterhof
87
Voted
COMBINATORICS
2002
116views more  COMBINATORICS 2002»
14 years 10 months ago
Toida's Conjecture is True
Let S be a subset of the units in Zn. Let be a circulant graph of order n (a Cayley graph of Zn) such that if ij E(), then i - j (mod n) S. Toida conjectured that if is another...
Edward Dobson, Joy Morris
92
Voted
ENDM
2002
91views more  ENDM 2002»
14 years 10 months ago
On minimally 3-connected graphs on a surface
It is well-known that the maximal size of minimally 3-connected graphs of order 7n is 93 -n . In this paper, we shall prove that if G is a minimally 3-connected graph of order n, ...
Katsuhiro Ota
101
Voted
JUCS
2002
89views more  JUCS 2002»
14 years 10 months ago
Scheduling Tasks to a Team of Autonomous Mobile Service Robots in Indoor Enviroments
Abstract: This paper presents a complete system for scheduling transportation orders to a fleet of autonomous mobile robots in service environments. It consists of the autonomous m...
Hartmut Surmann, Antonio Morales