Sciweavers

1972 search results - page 90 / 395
» connection 2008
Sort
View
PERCOM
2008
ACM
16 years 10 days ago
IP Address Passing for VANETs
In Vehicular Ad-hoc Networks (VANETs), vehicles can gain short connections to the Internet by using wireless access points (AP). A significant part of the connection time is the t...
Todd Arnold, Wyatt Lloyd, Jing Zhao, Guohong Cao
91
Voted
CCR
1998
75views more  CCR 1998»
15 years 13 days ago
A comparative analysis of groupware application protocols
Two of the most difficult problems faced by developers of synchronous groupware applications are the handling of multiple session connections and the maintenance of replicated dat...
Mark Pendergast
CACM
2008
53views more  CACM 2008»
15 years 26 days ago
Distributed selection: a missing piece of data aggregation
In this article, we study the problem of distributed selection from a theoretical point of view. Given a general connected graph of diameter D consisting of n nodes in which each ...
Fabian Kuhn, Thomas Locher, Roger Wattenhofer
106
Voted
TCS
2008
15 years 20 days ago
Digraph measures: Kelly decompositions, games, and orderings
We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, k-trees and cops and robber games and study their natural translations to ...
Paul Hunter, Stephan Kreutzer
94
Voted
DM
2008
55views more  DM 2008»
15 years 25 days ago
Improved pebbling bounds
Consider a configuration of pebbles distributed on the vertices of a connected graph of order n. A pebbling step consists of removing two pebbles from a given vertex and placing o...
Melody Chan, Anant P. Godbole