We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
The search for finite-state controllers for partially observable Markov decision processes (POMDPs) is often based on approaches like gradient ascent, attractive because of their ...
We propose a novel framework for constrained spectral
clustering with pairwise constraints which specify whether
two objects belong to the same cluster or not. Unlike previous
m...
Zhenguo Li (The Chinese University of Hong Kong), ...
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...
This paper presents a novel approach for landmarkbased shape deformation, in which fitting error and shape difference are formulated into a support vector machine (SVM) regression...