159 search results - page 24 / 32 » Weak Equivalences in Psi-Calculi |
98
Voted
ICIAP
2005
ACM
16 years 24 days ago
2005
ACM
This paper introduces a new efficient way for computing affine invariant features from gray-scale images. The method is based on a novel image transform which produces infinitely m...
96
Voted
ICFP
2002
ACM
16 years 19 days ago
2002
ACM
Motivated by applications to proof assistants based on dependent types, we develop and prove correct a strong reducer and equivalence checker for the -calculus with products, sums...
90
Voted
GLOBECOM
2009
IEEE
15 years 7 months ago
2009
IEEE
—We consider the Gaussian interference channel with an intermediate relay. The relay is assumed to have abundant power and is named potent for that reason. A main reason to consi...
100
Voted
TLCA
2009
Springer
15 years 7 months ago
2009
Springer
Abstract. Programming languages theory is full of problems that reduce to proving the consistency of a logic, such as the normalization of typed lambda-calculi, the decidability of...
72
Voted
CEAS
2007
Springer
15 years 6 months ago
2007
Springer
To evade blacklisting, the vast majority of spam email is sent from exploited MTAs (i.e., botnets) and with forged “From” addresses. In response, the anti-spam community has d...