Numerous cognitive studies have indicated that the form and complexity of route instructions may be as important to human navigators as the overall length of route. Most automated ...
We present two new Delaunay refinement algorithms, second an extension of the first. For a given input domain (a set of points or a planar straight line graph), and a threshold an...
Linear programming decoding for low-density parity check codes (and related domains such as compressed sensing) has received increased attention over recent years because of its p...
Sanjeev Arora, Constantinos Daskalakis, David Steu...
We present a novel coding-based technique for answering spatial and spatiotemporal queries on objects moving along a system of curves on the plane such as many road networks. We h...
Sandeep Gupta, Swastik Kopparty, Chinya V. Ravisha...
We develop a novel localization theory for planar networks of nodes that measure each other’s relative position, i.e., we assume that nodes do not have the ability to perform me...
Giulia Piova, Iman Shames, Baris Fidan, Francesco ...