Sciweavers

3702 search results - page 178 / 741
» All Pairings Are in a Group
Sort
View
ENDM
2008
114views more  ENDM 2008»
15 years 6 months ago
Strong oriented chromatic number of planar graphs without cycles of specific lengths
A strong oriented k-coloring of an oriented graph G is a homomorphism from G to H having k vertices labelled by the k elements of an abelian additive group M, such that for any p...
Mickaël Montassier, Pascal Ochem, Alexandre P...
EJC
2006
15 years 6 months ago
Tubes in PG(3, q)
A tube (resp. an oval tube) in PG(3, q) is a pair T = {L, L}, where {L} L is a collection of mutually disjoint lines of PG(3, q) such that for each plane of PG(3, q) containing L...
Peter J. Cameron, Norbert Knarr
AROBOTS
2004
93views more  AROBOTS 2004»
15 years 6 months ago
Propagation of Uncertainty in Cooperative Multirobot Localization: Analysis and Experimental Results
This paper examines the problem of cooperative localization for the case of large groups of mobile robots. A Kalman filter estimator is implemented and tested for this purpose. The...
Stergios I. Roumeliotis, Ioannis M. Rekleitis
TCS
1998
15 years 6 months ago
Conflict-Free Channel Set Assignment for an Optical Cluster Interconnection Network Based on Rotator Digraphs
Recently a class of scalable multi-star optical networks is proposed in [2]. In this class of networks nodes are grouped into clusters. Each cluster employs a separate pair of bro...
Peng-Jun Wan
MFCS
2010
Springer
15 years 5 months ago
A dexptime-Complete Dolev-Yao Theory with Distributive Encryption
In the context of modelling cryptographic tools like blind signatures and homomorphic encryption, the DolevYao model is typically extended with an operator over which encryption i...
Anguraj Baskar, Ramaswamy Ramanujam, S. P. Suresh