The identiļ¬cation of clusters, well-connected components in a graph, is useful in many applications from biological function prediction to social community detection. However, ļ...
In a bidirected graph, each end of each edge is independently oriented. We show how to express any column of the incidence matrix as a half-integral linear combination of any colum...
Abstract. The standard simulation of a nondeterministic Turing machine (NTM) by a deterministic one essentially searches a large boundeddegree graph whose size is exponential in th...
Subrahmanyam Kalyanasundaram, Richard J. Lipton, K...
This paper presents the person identification system developed at Athens Information Technology and its performance in the CLEAR 2007 evaluations. The system operates on the audiov...
Andreas Stergiou, Aristodemos Pnevmatikakis, Lazar...
Abstract. We show how to represent sets in a linear space data structure such that expressions involving unions and intersections of sets can be computed in a worst-case eļ¬cient ...