Sciweavers

142 search results - page 13 / 29
» Computing Maximum-Scoring Segments in Almost Linear Time
Sort
View
FSTTCS
2003
Springer
15 years 2 months ago
Comparing Sequences with Segment Rearrangements
Computational genomics involves comparing sequences based on “similarity” for detecting evolutionary and functional relationships. Until very recently, available portions of th...
Funda Ergün, S. Muthukrishnan, Süleyman ...
PAMI
2007
253views more  PAMI 2007»
14 years 9 months ago
Gaussian Mean-Shift Is an EM Algorithm
The mean-shift algorithm, based on ideas proposed by Fukunaga and Hostetler (1975), is a hill-climbing algorithm on the density defined by a finite mixture or a kernel density e...
Miguel Á. Carreira-Perpiñán
ICPR
2010
IEEE
15 years 4 months ago
A Unified Probabilistic Approach to Feature Matching and Object Segmentation
This paper deals with feature matching and segmentation of common objects in a pair of images, simultaneously. For the feature matching problem, the matching likelihoods of all fea...
Tae Hoon Kim (Seoul National University), Kyoung M...
CVPR
2007
IEEE
15 years 11 months ago
Tracking as Repeated Figure/Ground Segmentation
Tracking over a long period of time is challenging as the appearance, shape and scale of the object in question may vary. We propose a paradigm of tracking by repeatedly segmentin...
Xiaofeng Ren, Jitendra Malik
ICDCS
1998
IEEE
15 years 1 months ago
Improved Lightpath (Wavelength) Routing in Large WDM Networks
We address the problem of efficient circuit switching in wide area networks. The solution provided is based on finding optimal routes for lightpaths and semilightpaths. A lightpat...
Weifa Liang, George Havas, Xiaojun Shen