1801 search results - page 195 / 361 » Pointing without a pointer |
COMPGEOM
2009
ACM
15 years 4 months ago
2009
ACM
Color red and blue the n vertices of a convex polytope P in R3 . Can we compute the convex hull of each color class in o(n log n)? What if we have χ > 2 colors? What if the co...
103
Voted
JTRES
2009
ACM
15 years 4 months ago
2009
ACM
Large real-time software systems such as real-time Java virtual machines often use barrier protocols, which work for a dynamically varying number of threads without using centrali...
73
Voted
SIGCOMM
2009
ACM
15 years 4 months ago
2009
ACM
To search the web quickly, search engines partition the web index over many machines, and consult every partition when answering a query. To increase throughput, replicas are adde...
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
An ad hoc network is a highly dynamic routing network cooperated by a set of wireless mobile nodes without any assistance of centralized access point. ARIADNE is a well-known secu...
AINA
2008
IEEE
15 years 4 months ago
2008
IEEE
In this paper, we propose a map matching algorithm for car navigation systems that predict user destination. This car navigation system is a novel system that automatically predict...