Sciweavers

455 search results - page 34 / 91
» A local approximation algorithm for maximum weight matching
Sort
View
CSB
2005
IEEE
139views Bioinformatics» more  CSB 2005»
15 years 3 months ago
Using Parallel Algorithms for Searching Molecular Sequence Databases
This work presents the development of algorithms for approximate string matching using parallel methods. It intends to do the maximum of molecular sequences comparisons per unity ...
Carla Correa Tavares dos Reis, Rubem P. Mondaini
CCR
2004
110views more  CCR 2004»
14 years 9 months ago
Distributed scheduling policies in networks of input-queued packet switches
Scheduling algorithms for input-queued packet switches have been widely researched. It has been shown that various classes of scheduling algorithms provide guarantees on stability ...
Claus Bauer
ECCV
2008
Springer
15 years 11 months ago
Shape Matching by Segmentation Averaging
We use segmentations to match images by shape. To address the unreliability of segmentations, we give a closed form approximation to an average over all segmentations. Our techniqu...
Hongzhi Wang, John Oliensis
DAGM
2004
Springer
15 years 3 months ago
A Probabilistic Framework for Robust and Accurate Matching of Point Clouds
We present a probabilistic framework for matching of point clouds. Variants of the ICP algorithm typically pair points to points or points to lines. Instead, we pair data points to...
Peter Biber, Sven Fleck, Wolfgang Straßer
DEBU
2010
108views more  DEBU 2010»
14 years 9 months ago
Weighted Set-Based String Similarity
Consider a universe of tokens, each of which is associated with a weight, and a database consisting of strings that can be represented as subsets of these tokens. Given a query st...
Marios Hadjieleftheriou, Divesh Srivastava