Contextual reasoning through graphical models such as Markov Random Fields often show superior performance against local classifiers in many domains. Unfortunately, this performanc...
In many social settings, images of groups of people are captured. The structure of this group provides meaningful context for reasoning about individuals in the group, and about th...
Abstract. We present a disjoint reachability analysis for Java. Our analysis computes extended points-to graphs annotated with reachability states. Each heap annotated with a set o...
James Christopher Jenista, Yong Hun Eom, Brian Dem...
Abstract. Given an LLL-basis B of dimension n = hk we accelerate slide-reduction with blocksize k to run under a reasonable assumption within 1 6 n2 h log1+ε α local SVP-computat...
Abstract—The k-means method is a simple and fast clustering technique that exhibits the problem of specifying the optimal number of clusters preliminarily. We address the problem...