625 search results - page 43 / 125 » Approximating Travel Times Using Opportunistic Networking |
113
click to vote
FOCS
2006
IEEE
15 years 8 months ago
2006
IEEE
d abstract] Robert Krauthgamer ∗ IBM Almaden James R. Lee † Institute for Advanced Study We initiate the study of approximate algorithms on negatively curved spaces. These spa...
133
click to vote
COMPGEOM
2005
ACM
15 years 3 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
107
click to vote
INFOCOM
1997
IEEE
15 years 6 months ago
1997
IEEE
Replication is a commonly proposed solution to problems of scale associated with distributed services. However, when a service is replicated, each client must be assigned a server...
129
click to vote
SSD
2005
Springer
15 years 7 months ago
2005
Springer
In this paper we discuss a new type of query in Spatial Databases, called the Trip Planning Query (TPQ). Given a set of points of interest P in space, where each point belongs to ...
104
click to vote
ENTCS
2007
15 years 1 months ago
2007
In this paper we present an analysis of a MAC (Medium Access Control) protocol for wireless sensor networks. The purpose of this protocol is to manage wireless media access by con...