Sciweavers

160 search results - page 19 / 32
» Homomorphism preservation theorems
Sort
View
GLOBECOM
2006
IEEE
14 years 1 months ago
Secure Aggregation in Large Scale Overlay Networks
Overlay networks have been very useful in solving large scale data dissemination problems. In this paper, we consider the case of data gathering which is the inverse of disseminat...
Waseem Ahmad, Ashfaq A. Khokhar
IJFCS
2010
60views more  IJFCS 2010»
13 years 6 months ago
Properties of Quasi-Relabeling Tree Bimorphisms
The fundamental properties of the class QUASI of quasi-relabeling relations are investigated. A quasi-relabeling relation is a tree relation that is dened by a tree bimorphism (...
Andreas Maletti, Catalin Ionut Tîrnauca
GG
2004
Springer
14 years 26 days ago
Composition of Path Transductions
We propose to study two infinite graph transformations that we respectively call bounded and unbounded path transduction. These graph transformations are based on path substitutio...
Tanguy Urvoy
FSTTCS
1999
Springer
13 years 11 months ago
Explicit Substitutions and Programming Languages
The λ-calculus has been much used to study the theory of substitution in logical systems and programming languages. However, with explicit substitutions, it is possible to get fi...
Jean-Jacques Lévy, Luc Maranget
FSS
2008
82views more  FSS 2008»
13 years 7 months ago
Lattice-valued convergence spaces and regularity
: We define a regularity axiom for lattice-valued convergence spaces where the lattice is a complete Heyting algebra. To this end, we generalize the characterization of regularity ...
Gunther Jäger