Sciweavers

11381 search results - page 2273 / 2277
» Connectivity
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
15 years 2 months ago
Localized construction of bounded degree and planar spanner for wireless ad hoc networks
We propose a novel localized algorithm that constructs a bounded degree and planar spanner for wireless ad hoc networks modeled by unit disk graph (UDG). Every node only has to kn...
Yu Wang 0003, Xiang-Yang Li
CBMS
2004
IEEE
15 years 1 months ago
Online Medical Teaching Case Database
Page >> Table of Contents >> Abstract 17th IEEE Symposium on Computer-Based Medical Systems (CBMS'04) p. 420 Online Medical Teaching Case Database Susan Kansagra, ...
Susan Kansagra, Chris Chang, Saleem Hussain, Grego...
MOBISYS
2010
ACM
14 years 12 months ago
Augmenting mobile 3G using WiFi
We investigate if WiFi access can be used to augment 3G capacity in mobile environments. We first conduct a detailed study of 3G and WiFi access from moving vehicles, in three dif...
Aruna Balasubramanian, Ratul Mahajan, Arun Venkata...
LISA
2004
14 years 11 months ago
autoMAC: A Tool for Automating Network Moves, Adds, and Changes
It is often difficult and time-consuming to manage computer `moves, adds, and changes' that take place in a switched, subnetted environment. It is even more difficult when th...
Christopher J. Tengi, James M. Roberts, Joseph R. ...
DIMACS
1996
14 years 11 months ago
Easier Ways to Win Logical Games
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
Ronald Fagin
« Prev « First page 2273 / 2277 Last » Next »