Search

5 Apr 2011: Hotel Bar Hotel 0.24 0.07Engineering University 0.24 0.07. Movie Theater Mall 0.24 0.06Other - Travel Highway / Traffic 0.23 0.11.

13 Sep 2011: Previous studies [24], [25], [26], [27], [28] show how theperformance of traditional Ad-Hoc routing dissemination isheavily affected by vehicle density in urban areas. ... Wemeasured the amount of data transferred during each contact.On average, β

30 May 2011: 94.7%) 9.013 138,387 630,045 131,711 (95.1%) 9.104 159,391 736,778 152,011 (95.3%) 9.24. ... 24] L. B. Statistics and L. Breiman. Random Forests. InMachine Learning, pages 5–32, 2001.

9 Jul 2011: Re-cently, we have seen a soaring number of systems based onsmart phones aimed at social psychological and behavioralmonitoring studies [16, 24, 31]. ... Even though this is exponential,the total number of subtasks n is in practice small [10, 24].For

12 Mar 2011: Each vehicle is equipped with a GPS trackingdevice that is used by dispatchers to efficiently reach customers [24]. ... In the Dartmouth WiFi andCabspotting datasets the number of significant places is 18 and 24, respectively.

22 Apr 2011: Cluster 1(21) Cluster 2(23) Cluster 3(20) Cluster 4(10) Cluster 5(24) Cluster 6(19) Cluster 7(12) Cluster 8(45) Cluster 9(54)Home (0.54)

31 Oct 2011: This approach can be implemented in a real mobilenetwork: each node i may maintain a table of Lamportclocks [24] that contains the shortest temporal distancesto all known nodes that can contact

27 Apr 2011: Consequently the neighbor detection period was reduced to three seconds.Thirdly, the neighborhood cache entries were set to be valid for 24 hours. ... Throughoutour evaluation, we used N = 24 1-hour timeslots, that is T = 3600s.

27 Apr 2011: Nodesrepresent devices; two nodes are linked if there was a Bluetooth contactwithin that 24-hour window. ... as the fraction of shortest paths between all pairs of nodeswhich pass through i [24].

3 May 2011: 18. 20. 22. 24. 26. 28. 30. 0.0100 5.0105 1.0106 1.5106 2.0106 2.5106.