Inverted index data structures are the key to fast search engines. The predominant operation on inverted indices asks for intersecting two sorted lists of document IDs which might...
In this paper, we present a free-and-easy data publishing and sharing system based on folksonomy. The system accepts data objects described with user-created metadata, called data...
We describe two market-inspired approaches to propositional satisfiability. Whereas a previous market-inspired approach exhibited extremely slow performance, we find that variatio...
William E. Walsh, Makoto Yokoo, Katsutoshi Hirayam...
Embedding algorithms search for low dimensional structure in complex data, but most algorithms only handle objects of a single type for which pairwise distances are specified. Thi...
Amir Globerson, Gal Chechik, Fernando C. Pereira, ...
Point location is the problem of preprocessing a planar polygonal subdivision S into a data structure in order to determine efficiently the cell of the subdivision that contains a...