In this paper we describe the parallelization of a dynamic programming algorithm used to find common RNA secondary structures including pseudoknots and similar structures. The se...
We present a succinct representation of a set of n points on an n × n grid using n lg n + o(n lg n) bits3 to support orthogonal range counting in O(lg n/ lg lg n) time, and range ...
Prosenjit Bose, Meng He, Anil Maheshwari, Pat Mori...
Since the invention of AVL trees in 1962, a wide variety of ways to balance binary search trees have been proposed. Notable are red-black trees, in which bottom-up rebalancing afte...
Bernhard Haeupler, Siddhartha Sen, Robert Endre Ta...
In a distributed network, a compact multicast scheme is a routing scheme that allows any source to send messages to any set of targets. We study the trade-off between the space us...
Recently there has been increasing interest in the problem of transfer learning, in which the typical assumption that training and testing data are drawn from identical distributi...