Let G be a multigraph. We say that G is 1-extendable if every edge of G is contained in a 1-factor. Suppose G is 1-extendable. An excessive factorization of G is a set F = {F1, F2...
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most on...
Most traditional approaches to probabilistic planning in relationally specified MDPs rely on grounding the problem w.r.t. specific domain instantiations, thereby incurring a com...
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor α that spre...
Abstract: Polynomial computations over fixed-size bitvectors are found in many practical datapath designs. For efficient RTL synthesis, it is important to identify good decompositi...
Sivaram Gopalakrishnan, Priyank Kalla, M. Brandon ...