—Space-filling layout techniques for tree representations are frequently used when the available screen space is small or the data set is large. In this paper, we propose an ef...
Given a large directed graph, rapidly answering reachability queries between source and target nodes is an important problem. Existing methods for reachability trade-off indexing ...
Hilmi Yildirim, Vineet Chaoji, Mohammed Javeed Zak...
Classification problems with a very large or unbounded set of output categories are common in many areas such as natural language and image processing. In order to improve accurac...
Ivan Titov, Alexandre Klementiev, Kevin Small, Dan...
We propose a new approach to the problem of searching a space of policies for a Markov decision process (MDP) or a partially observable Markov decision process (POMDP), given a mo...
Millions of small heterogeneous computers are poised to spread into the infrastructure of our society. Though mostly inconspicuous today, disguised as nothing more than PIM (perso...
Tobin J. Lehman, Stephen W. McLaughry, Peter Wycko...