145 search results - page 26 / 29 » On finding approximate optimal paths in weighted regions |
CPM
1993
Springer
13 years 11 months ago
1993
Springer
It is widely accepted that the optimal alignment between a pair of proteins or nucleic acid sequences that minimizes the edit distance may not necessarily re
ect the correct biolog...
CVPR
2010
IEEE
14 years 3 months ago
2010
IEEE
Interactive segmentation is useful for selecting objects of interest in images and continues to be a topic of much study. Methods that grow regions from foreground/background seed...
COLT
2010
Springer
13 years 5 months ago
2010
Springer
We study graph estimation and density estimation in high dimensions, using a family of density estimators based on forest structured undirected graphical models. For density estim...
ALENEX
2009
13 years 5 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
SODA
2010
ACM
14 years 4 months ago
2010
ACM
The hypergraph matching problem is to find a largest collection of disjoint hyperedges in a hypergraph. This is a well-studied problem in combinatorial optimization and graph theo...