Sciweavers

331 search results - page 37 / 67
» Fast Matching for All Pairs Similarity Search
Sort
View
AVSS
2005
IEEE
15 years 3 months ago
View registration using interesting segments of planar trajectories
We introduce a method for recovering the spatial and temporal alignment between two or more views of objects moving over a ground plane. Existing approaches either assume that the...
Walter Nunziati, Jonathan Alon, Stan Sclaroff, Alb...
74
Voted
BMCBI
2007
119views more  BMCBI 2007»
14 years 9 months ago
A dynamic programming approach for the alignment of signal peaks in multiple gas chromatography-mass spectrometry experiments
Background: Gas chromatography-mass spectrometry (GC-MS) is a robust platform for the profiling of certain classes of small molecules in biological samples. When multiple samples ...
Mark D. Robinson, David P. De Souza, Woon Wai Keen...
CORR
2008
Springer
126views Education» more  CORR 2008»
14 years 9 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
NIPS
2008
14 years 11 months ago
Grouping Contours Via a Related Image
Contours have been established in the biological and computer vision literature as a compact yet descriptive representation of object shape. While individual contours provide stru...
Praveen Srinivasan, Liming Wang, Jianbo Shi
IPM
2007
105views more  IPM 2007»
14 years 9 months ago
Schema and constraints-based matching and merging of Topic Maps
In this paper, we propose a multi-strategic matching and merging approach to find correspondences between ontologies based on the syntactic or semantic characteristics and constr...
Jung-Min Kim, Hyopil Shin, Hyoung-Joo Kim