Sciweavers

1290 search results - page 50 / 258
» Popular Matchings: Structure and Algorithms
Sort
View
DAGSTUHL
1996
15 years 5 months ago
Self-Organizing Data Structures
We survey results on self-organizing data structures for the search problem and concentrate on two very popular structures: the unsorted linear list, and the binary search tree. Fo...
Susanne Albers, Jeffery Westbrook
ICIP
2007
IEEE
16 years 6 months ago
Fundamental Matrix Estimation Without Prior Match
This paper presents a probabilistic framework for computing correspondences and fundamental matrix in the structure from motion problem. Inspired by Moisan and Stival [1], we sugg...
Frédéric Sur, Marie-Odile Berger, Ni...
PKDD
2007
Springer
109views Data Mining» more  PKDD 2007»
15 years 10 months ago
Matching Partitions over Time to Reliably Capture Local Clusters in Noisy Domains
Abstract. When seeking for small clusters it is very intricate to distinguish between incidental agglomeration of noisy points and true local patterns. We present the PAMALOC algor...
Frank Höppner, Mirko Böttcher
158
Voted
AVSS
2005
IEEE
15 years 10 months ago
Multiple object tracking using elastic matching
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is gener...
Xingzhi Luo, Suchendra M. Bhandarkar
148
Voted
ICIAR
2005
Springer
15 years 10 months ago
A Novel Tracking Framework Using Kalman Filtering and Elastic Matching
A novel region-based multiple object tracking framework based on Kalman filtering and elastic matching is proposed. The proposed Kalman filtering-elastic matching model is genera...
Xingzhi Luo, Suchendra M. Bhandarkar