Sciweavers

2342 search results - page 369 / 469
» Sublinear geometric algorithms
Sort
View
131
Voted
WADS
1993
Springer
163views Algorithms» more  WADS 1993»
15 years 4 months ago
Minimum Weight Euclidean Matching and Weighted Relative Neighborhood Graphs
The Minimum Weight Euclidean Matching (MWEM) problem is: given 2n point sites in the plane with Euclidean metric for interpoint distances, match the sites into n pairs so that the...
Andy Mirzaian
COMPGEOM
2011
ACM
14 years 4 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...
132
Voted
CVPR
2008
IEEE
16 years 5 months ago
Illumination and Camera Invariant Stereo Matching
Color information can be used as a basic and crucial cue for finding correspondence in a stereo matching algorithm. In a real scene, however, image colors are affected by various g...
Yong Seok Heo (Seoul National University), Kyoung ...
86
Voted
CVPR
2006
IEEE
16 years 2 months ago
Robust Fragments-based Tracking using the Integral Histogram
We present a novel algorithm (which we call "FragTrack") for tracking an object in a video sequence. The template object is represented by multiple image fragments or pa...
Amit Adam, Ehud Rivlin, Ilan Shimshoni
DAC
2007
ACM
16 years 1 months ago
Gate Sizing For Cell Library-Based Designs
With increasing time-to-market pressure and shortening semiconductor product cycles, more and more chips are being designed with library-based methodologies. In spite of this shif...
Shiyan Hu, Mahesh Ketkar, Jiang Hu