We present a novel Locality-Sensitive Hashing scheme for the Approximate Nearest Neighbor Problem under ÐÔ norm, based on Ôstable distributions. Our scheme improves the running...
Mayur Datar, Nicole Immorlica, Piotr Indyk, Vahab ...
As computing and communications technologies evolve, there is the potential for new forms of digitally orchestrated interactive narratives to emerge. In this process, balanced atte...
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
In this paper, we propose a new feature extraction method, which is robust against rotation and histogram equalization for texture classification. To this end, we introduce the co...
We evaluate the impact of a gigabit network on the implementation of a distributed chemical process optimization application. The optimization problem is formulated as a stochasti...