Sciweavers

2219 search results - page 357 / 444
» Dynamic Programming and Graph Algorithms in Computer Vision
Sort
View
123
Voted
WABI
2009
Springer
128views Bioinformatics» more  WABI 2009»
15 years 9 months ago
A General Framework for Local Pairwise Alignment Statistics with Gaps
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...
Pasi Rastas
AAAI
2004
15 years 3 months ago
Stochastic Local Search for POMDP Controllers
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 ...
Darius Braziunas, Craig Boutilier
CVPR
2009
IEEE
16 years 9 months ago
Constrained Clustering via Spectral Regularization
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), ...
151
Voted
CVPR
2009
IEEE
16 years 9 months ago
Learning query-dependent prefilters for scalable image retrieval
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...
ICCV
2003
IEEE
16 years 4 months ago
Landmark-based Shape Deformation with Topology-Preserving Constraints
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...
Song Wang, Jim Xiuquan Ji, Zhi-Pei Liang