We consider the problem of handling similarity queries in peer-to-peer databases. Given a query for a data object, we propose an indexing and searching mechanism which returns the...
Indrajit Bhattacharya, Srinivas R. Kashyap, Sriniv...
Key-value stores (KVSs) are the most prevalent storage systems for large scale web services. As they do not have the structural complexities of RDBMSs, they are more efficient. In...
Many interesting Web-based AI problems require the ability to collect, store and process large text datasets. To address this problem, we have developed Slashpack, an integrated t...
Christopher H. Brooks, Monica Agarwal, Jason Endo,...
The paper has two main contributions: The rst is a set of methods for computing structure and motion for m 3 views of 6 points. It is shown that a geometric image error can be mini...
Frederik Schaffalitzky, Andrew Zisserman, Richard ...
We propose a novel method of robustly and automatically creating surface meshes from the very sparsely populated 3D point clouds typically produced by Structure from Motion algori...