Sciweavers

4744 search results - page 57 / 949
» Connected Computing
Sort
View
HPDC
2008
IEEE
15 years 6 months ago
Improving peer connectivity in wide-area overlays of virtual workstations
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized...
Arijit Ganguly, P. Oscar Boykin, David Wolinsky, R...
ICALP
2007
Springer
15 years 6 months ago
Labeling Schemes for Vertex Connectivity
This paper studies labeling schemes for the vertex connectivity function on general graphs. We consider the problem of labeling the nodes of any n-node graph is such a way that gi...
Amos Korman
NETWORKING
2004
15 years 1 months ago
Bounds on Benefits and Harms of Adding Connections to Noncooperative Networks
Abstract. In computer networks (and, say, transportation networks), we can consider the situation where each user has its own routing decision so as to minimize noncooperatively th...
Hisao Kameda
ICALP
2007
Springer
15 years 6 months ago
Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
We study the problem of finding occurrences of motifs in vertex-colored graphs, where a motif is a multiset of colors, and an occurrence of a motif is a subset of connected vertic...
Michael R. Fellows, Guillaume Fertin, Danny Hermel...
MDM
2005
Springer
15 years 5 months ago
Scalable synchronization of intermittently connected database clients
Synchronization performance is a major problem with intermittently connected mobile databases. A server periodically generates update files for each client, which are downloaded ...
Wai Gen Yee, Ophir Frieder