Sciweavers

8228 search results - page 1628 / 1646
» Structural Logical Relations
Sort
View
COMBINATORICS
1999
64views more  COMBINATORICS 1999»
13 years 7 months ago
Orthogonal Colorings of Graphs
An orthogonal coloring of a graph G is a pair {c1, c2} of proper colorings of G, having the property that if two vertices are colored with the same color in c1, then they must hav...
Yair Caro, Raphael Yuster
JCISE
2002
128views more  JCISE 2002»
13 years 7 months ago
A Collaborative Framework for Integrated Part and Assembly Modeling
An ideal product modeling system should support both part modeling and assembly modeling, instead of just either of them as is the case in most current CAD systems. A good basis f...
Rafael Bidarra, Niels Kranendonk, Alex Noort, Will...
DAM
1999
114views more  DAM 1999»
13 years 7 months ago
Perfect and Almost Perfect Sequences
The autocorrelation function of a sequence is a measure for how much the given sequence di ers from its translates. Periodic binary sequences with good correlation properties have...
Dieter Jungnickel, Alexander Pott
MLQ
2002
87views more  MLQ 2002»
13 years 7 months ago
A Relationship between Equilogical Spaces and Type Two Effectivity
Abstract. In this paper I compare two well studied approaches to topological semantics-the domain-theoretic approach, exemplified by the category of countably based equilogical spa...
Andrej Bauer
MOC
1998
93views more  MOC 1998»
13 years 7 months ago
Computing ray class groups, conductors and discriminants
We use the algorithmic computation of exact sequences of Abelian groups to compute the complete structure of (ZK /m)∗ for an ideal m of a number field K, as well as ray class gr...
Henri Cohen, Francisco Diaz y Diaz, Michel Olivier
« Prev « First page 1628 / 1646 Last » Next »