625 search results - page 30 / 125 » Approximating Travel Times Using Opportunistic Networking |
204
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
The popularity of location-based services and the need to do real-time processing on them has led to an interest in performing queries on transportation networks, such as finding s...
106
click to vote
CVPR
1999
IEEE
16 years 1 months ago
1999
IEEE
We present a novel mixed-state dynamic Bayesian network (DBN) framework for modeling and classifying timeseries data such as object trajectories. A hidden Markov model (HMM) of di...
115
click to vote
NETWORKS
2002
14 years 11 months ago
2002
Consider a requirement graph whose vertices represent customers and an edge represents the need to route a unit of flow between its end vertices along a single path. All of these ...
ASPLOS
2010
ACM
15 years 3 months ago
2010
ACM
We present an all-optical approach to constructing data networks on chip that combines the following key features: (1) Wavelengthbased routing, where the route followed by a packe...
87
Voted
STOC
2002
ACM
16 years 1 days ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...