Sciweavers

625 search results - page 22 / 125
» Approximating Travel Times Using Opportunistic Networking
Sort
View
KDD
2006
ACM
157views Data Mining» more  KDD 2006»
15 years 10 months ago
Using structure indices for efficient approximation of network properties
Statistics on networks have become vital to the study of relational data drawn from areas such as bibliometrics, fraud detection, bioinformatics, and the Internet. Calculating man...
Matthew J. Rattigan, Marc Maier, David Jensen
JMLR
2010
140views more  JMLR 2010»
14 years 4 months ago
Mean Field Variational Approximation for Continuous-Time Bayesian Networks
Continuous-time Bayesian networks is a natural structured representation language for multicomponent stochastic processes that evolve continuously over time. Despite the compact r...
Ido Cohn, Tal El-Hay, Nir Friedman, Raz Kupferman
SODA
2010
ACM
397views Algorithms» more  SODA 2010»
15 years 6 months ago
Improved Approximation Algorithms for the Minimum Latency Problem via Prize-Collecting Strolls
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
Aaron Archer, Anna Blasiak
CORR
2006
Springer
121views Education» more  CORR 2006»
14 years 9 months ago
A Scalable Protocol for Cooperative Time Synchronization Using Spatial Averaging
Time synchronization is an important aspect of sensor network operation. However, it is well known that synchronization error accumulates over multiple hops. This presents a challe...
An-Swol Hu, Sergio D. Servetto
INFOCOM
2009
IEEE
15 years 4 months ago
Alpha Coverage: Bounding the Interconnection Gap for Vehicular Internet Access
—Vehicular Internet access via open WLAN access points (APs) has been demonstrated to be a feasible solution to provide opportunistic data service to moving vehicles. Using an in...
Zizhan Zheng, Prasun Sinha, Santosh Kumar