727 search results - page 135 / 146 » ads 2004 |
ADHOCNOW
2004
Springer
14 years 29 days ago
2004
Springer
Consider k particles, 1 red and k −1 white, chasing each other on the nodes of a graph G. If the red one catches one of the white, it “infects” it with its color. The newly ...
APPROX
2004
Springer
14 years 29 days ago
2004
Springer
The central observation of this paper is that if ǫn random arcs are added to any n-node strongly connected digraph with bounded degree then the resulting graph has diameter O(ln ...
CSL
2004
Springer
14 years 29 days ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
DEXA
2004
Springer
14 years 29 days ago
2004
Springer
Data integration is the process that gives users access to multiple data sources though queries against a global schema. Semantic heterogeneity has been identified as the most imp...
DIAGRAMS
2004
Springer
14 years 29 days ago
2004
Springer
A composite cluster map displays a fuzzy categorisation of geographic areas. It combines information from several sources to provide a visualisation of the significance of cluster...