Sciweavers

4218 search results - page 201 / 844
» Complete sets of cooperations
Sort
View
COMBINATORICS
2006
105views more  COMBINATORICS 2006»
13 years 10 months ago
A New Table of Constant Weight Codes of Length Greater than 28
Existing tables of constant weight codes are mainly confined to codes of length n 28. This paper presents tables of codes of lengths 29 n 63. The motivation for creating these ...
Derek H. Smith, L. A. Hughes, Stephanie Perkins
ENTCS
2006
130views more  ENTCS 2006»
13 years 10 months ago
Modularity in Coalgebra
This paper gives an overview of recent results concerning the modular derivation of (i) modal specification logics, (ii) notions of simulation together with logical characterisati...
Corina Cîrstea
GC
2006
Springer
13 years 10 months ago
On n-partite Tournaments with Unique n-cycle
An n-partite tournament is an orientation of a complete n-partite graph. An npartite tournament is a tournament, if it contains exactly one vertex in each partite set. Douglas, Pr...
Gregory Gutin, Arash Rafiey, Anders Yeo
PR
2000
92views more  PR 2000»
13 years 10 months ago
On the independence of rotation moment invariants
The problem of the independence and completeness of rotation moment invariants is addressed in this paper. First, a general method for constructing invariants of arbitrary orders ...
Jan Flusser
MCU
2004
126views Hardware» more  MCU 2004»
14 years 5 days ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner