We present an expected polynomial time algorithm to generate an unlabeled connected cubic planar graph uniformly at random. We first consider rooted connected cubic planar graphs, ...
Background: Determination of protein-DNA complex structures with both NMR and X-ray crystallography remains challenging in many cases. High Ambiguity-Driven DOCKing (HADDOCK) is a...
Analyzing videos of human activities involves not only
recognizing actions (typically based on their appearances),
but also determining the story/plot of the video. The storyline...
Abhinav Gupta (University of Maryland), Praveen Sr...
We describe an algorithm for similar-image search which
is designed to be efficient for extremely large collections of
images. For each query, a small response set is selected by...
Lorenzo Torresani (Dartmouth College), Martin Szum...
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...