625 search results - page 57 / 125 » Approximating Travel Times Using Opportunistic Networking |
153
Voted
STOC
2005
ACM
15 years 9 months ago
2005
ACM
A dynamic geometric data stream consists of a sequence of m insert/delete operations of points from the discrete space {1, . . . , ∆}d [26]. We develop streaming (1 + )-approxim...
115
click to vote
CISS
2008
IEEE
15 years 10 months ago
2008
IEEE
— It has been known since the early 1990s that backpressure-type algorithms for communication networks (such as the Max-Weight algorithm) can be used to approximately solve stati...
124
Voted
NETWORK
2007
15 years 2 months ago
2007
Voice over IP is one of the most popular applications in broadband access networks. It is anticipated that the characteristics of call holding times (CHTs) for VoIP calls will be ...
110
Voted
NN
1998
Springer
15 years 3 months ago
1998
Springer
Cross validation can be used to detect when over tting starts during supervised training of a neural network; training is then stopped before convergence to avoid the overtting ...
116
Voted
WEA
2007
Springer
15 years 9 months ago
2007
Springer
We study the real algorithm for the point-to-point shortest path problem. It combines A∗ search search, landmark-based lower bounds, and reach-based pruning. We suggest several ...