Recent work has demonstrated that using a carefully designed sensing matrix rather than a random one, can improve the performance of compressed sensing. In particular, a welldesign...
Kevin Rosenblum, Lihi Zelnik-Manor, Yonina C. Elda...
Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g D such that q contains g (q g). Due to the wide adoption of graph models, f...
Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, D...
Planning graphs have been shown to be a rich source of heuristic information for many kinds of planners. In many cases, planners must compute a planning graph for each element of ...
Daniel Bryce, William Cushing, Subbarao Kambhampat...
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
nd: Although methods based on highly abstract descriptions of protein structures, such as VAST and TOPS, can perform very fast protein structure comparison, the results can lack a...
Mallika Veeramalai, David Gilbert, Gabriel Valient...