625 search results - page 52 / 125 » Approximating Travel Times Using Opportunistic Networking |
157
click to vote
MOBIHOC
2002
ACM
16 years 3 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
124
Voted
ISORC
2000
IEEE
15 years 7 months ago
2000
IEEE
There have been many debates about the feasibility of providing guaranteed Quality of Service (QoS) when network traffic travels beyond the enterprise domain and into the vast unk...
114
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
— This paper describes an algorithm for estimating lane boundaries and curbs from a moving vehicle using noisy observations and a probabilistic model of curvature. The primary co...
117
Voted
ESA
2003
Springer
15 years 8 months ago
2003
Springer
In ad-hoc wireless networks, certain network connectivity constraints are of interest because of their practical importance. An example of such a constraint would be strong connec...
141
Voted
IFIP
2004
Springer
15 years 8 months ago
2004
Springer
Abstract— An ad hoc wireless network is an autonomous selforganizing system of mobile nodes connected by wireless links where nodes not in direct range communicate via intermedia...