Sciweavers

8838 search results - page 321 / 1768
» Generalizing Domain Theory
Sort
View
CEAS
2006
Springer
15 years 10 months ago
Sender Reputation in a Large Webmail Service
In this paper, we describe how a large webmail service uses reputation to classify authenticated sending domains as either spammy or not spammy. Both SPF and DomainKey authenticat...
Bradley Taylor
AINA
2009
IEEE
16 years 1 months ago
The Small-World Model for Amino Acid Interaction Networks
—In this paper we introduce the notion of protein interaction network. This is a graph whose vertices are the protein’s amino acids and whose edges are the interactions between...
Omar Gaci, Stefan Balev
TIME
2008
IEEE
16 years 1 months ago
Moving Spaces
Boolean contact algebras constitute a convenient approach to a region based theory of space. In this paper we want to extend this approach to regions moving in time - called timed...
Ivo Düntsch, Michael Winter
CIE
2007
Springer
16 years 27 days ago
Locally Computable Structures
We introduce the notion of a locally computable structure, a natural way of generalizing the notions of computable model theory to uncountable structures S by presenting the finit...
Russell G. Miller
FCT
2007
Springer
16 years 27 days ago
Path Algorithms on Regular Graphs
We consider standard algorithms of finite graph theory, like for instance shortest path algorithms. We present two general methods to polynomially extend these algorithms to infi...
Didier Caucal, Dinh Trong Hieu