625 search results - page 58 / 125 » Approximating Travel Times Using Opportunistic Networking |
133
click to vote
JUCS
2008
15 years 3 months ago
2008
Abstract: Nowadays, more and more users make use of web-based collaborative systems. Users participate in communities or search for and provide information in webbased systems. The...
122
click to vote
KDD
2003
ACM
16 years 3 months ago
2003
ACM
Data Mining with Bayesian Network learning has two important characteristics: under broad conditions learned edges between variables correspond to causal influences, and second, f...
151
Voted
IPSN
2009
Springer
15 years 10 months ago
2009
Springer
This paper exploits recent developments in sparse approximation and compressive sensing to efficiently perform localization in a sensor network. We introduce a Bayesian framework...
115
click to vote
IPPS
2005
IEEE
15 years 9 months ago
2005
IEEE
The Chained Lin-Kernighan algorithm (CLK) is one of the best heuristics to solve Traveling Salesman Problems (TSP). In this paper a distributed algorithm is proposed, were nodes i...
129
Voted
INFOCOM
2012
IEEE
13 years 5 months ago
2012
IEEE
—Knowledge of a network’s topology and internal characteristics such as delay times or losses is crucial to maintain seamless operation of network services. Network tomography ...