— This paper introduces the contextual dissimilarity measure which significantly improves the accuracy of bag-offeatures based image search. Our measure takes into account the l...
We consider the problem of computing minimum geometric hitting sets in which, given a set of geometric objects and a set of points, the goal is to compute the smallest subset of p...
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
It has long been known that a fixed ordering of optimization phases will not produce the best code for every application. One approach for addressing this phase ordering problem ...
Prasad Kulkarni, Stephen Hines, Jason Hiser, David...
We propose an efficient algorithm for mining frequent approximate sequential patterns under the Hamming distance model. Our algorithm gains its efficiency by adopting a "brea...