Sciweavers

526 search results - page 8 / 106
» On circularly symmetric functions
Sort
View
SPAA
2006
ACM
15 years 5 months ago
Symmetric network computation
We introduce a simple new model of distributed computation — finite-state symmetric graph automata (FSSGA) — which captures the qualitative properties common to fault-toleran...
David Pritchard, Santosh Vempala
92
Voted
IJRFITA
2007
84views more  IJRFITA 2007»
14 years 11 months ago
Characterisation of RF propagation in metal pipes for passive RFID systems
: In this paper we extend the theory of Radio Frequency (RF) propagation as it relates to propagation within metal circular pipes. This work is motivated by a need to understand th...
Darmindra D. Arumugam, Daniel W. Engels
84
Voted
DCC
2006
IEEE
15 years 11 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
70
Voted
CORR
2006
Springer
100views Education» more  CORR 2006»
14 years 11 months ago
Minimizing Symmetric Set Functions Faster
We describe a combinatorial algorithm which, given a monotone and consistent symmetric set function d on a finite set V in the sense of Rizzi [Riz00], constructs a non trivial set...
Michael Brinkmeier
JCT
2008
62views more  JCT 2008»
14 years 11 months ago
A Schur function identity related to the (-1)-enumeration of self-complementary plane partitions
We give another proof for the (-1)
Theresia Eisenkölbl