Sciweavers

3131 search results - page 626 / 627
» Generalized connection caching
Sort
View
DIALM
2003
ACM
175views Algorithms» more  DIALM 2003»
13 years 11 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
MOBISYS
2010
ACM
13 years 8 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...
DIMACS
1996
13 years 7 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
IJON
2007
120views more  IJON 2007»
13 years 5 months ago
Comparison of dynamical states of random networks with human EEG
Existing models of EEG have mainly focused on relations to network dynamics characterized by firing rates [L. de Arcangelis, H.J. Herrmann, C. Perrone-Capano, Activity-dependent ...
Ralph Meier, Arvind Kumar, Andreas Schulze-Bonhage...
BMCBI
2005
108views more  BMCBI 2005»
13 years 5 months ago
A linear memory algorithm for Baum-Welch training
Background: Baum-Welch training is an expectation-maximisation algorithm for training the emission and transition probabilities of hidden Markov models in a fully automated way. I...
István Miklós, Irmtraud M. Meyer