Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...
Supporting legacy applications when the database schema evolves represents a long-standing challenge of practical and theoretical importance. Recent work has produced algorithms a...
Carlo Curino, Hyun Jin Moon, Alin Deutsch, Carlo Z...
— Differential privacy has recently emerged as the de facto standard for private data release. This makes it possible to provide strong theoretical guarantees on the privacy and ...
Graham Cormode, Cecilia M. Procopiuc, Divesh Sriva...
This paper describes an imagingsystem that has been designed specifically for the purpose of recovering egomotion and structure from video. The system consists of six cameras in a...
When designing computer vision systems for the blind and visually impaired it is important to determine the orientation of the user relative to the scene. We observe that most ind...