In the interference scheduling problem, one is given a set of n communication requests described by sourcedestination pairs of nodes from a metric space. The nodes correspond to d...
Let G be an unweighted graph of complexity n embedded in a surface of genus g, orientable or not. We describe improved algorithms to compute a shortest non-contractible and a shor...
Frequent episode discovery is a popular framework for mining data available as a long sequence of events. An episode is essentially a short ordered sequence of event types and the...
Srivatsan Laxman, P. S. Sastry, K. P. Unnikrishnan
The maximum entropy principle is a cornerstone of FRAME (Filters, RAndom fields, and Maximum Entropy) model considered at times as a first-ever step towards a universal theory of ...
Georgy L. Gimel'farb, Luc J. Van Gool, Alexey Zale...
We extend Ukkonen's online suffix tree construction algorithm to support frequency queries, by adding count fields to the internal nodes of the tree, as suggested in [8]. Thi...