Abstract—We present here a method for analyzing the neighborhoods of all the vertices in a large graph. We first give an algorithm for characterizing a simple undirected graph t...
We show that every NP problem is polynomially equivalent to a simple combinatorial problem: the membership problem for a special class of digraphs. These classes are defined by me...
In this work, we study the correlation between attribute sets and the occurrence of dense subgraphs in large attributed graphs, a task we call structural correlation pattern minin...
Abstract--We present a method to extract and visualize vortices that originate from bounding walls of three-dimensional timedependent flows. These vortices can be detected using th...
Alexander Wiebel, Xavier Tricoche, Dominic Schne...
Classifiers are often used to detect miscreant activities. We study how an adversary can systematically query a classifier to elicit information that allows the adversary to evade...
Blaine Nelson, Benjamin I. P. Rubinstein, Ling Hua...