Sciweavers

148 search results - page 2 / 30
» Linear reductions of maximum matching
Sort
View
GLOBECOM
2008
IEEE
13 years 11 months ago
A Maximum-Likelihood Decoder with a New Reduction Strategy for MIMO Channel Systems
—An efficient maximum-likelihood decoder with a new reduction strategy is proposed for linear MIMO channel systems. Unlike the current reduction strategies which only reorder th...
Xiao-Wen Chang, Xiaohua Yang
JACM
2010
111views more  JACM 2010»
13 years 3 months ago
Finding a maximum matching in a sparse random graph in O(n) expected time
We present a linear expected time algorithm for finding maximum cardinality matchings in sparse random graphs. This is optimal and improves on previous results by a logarithmic f...
Prasad Chebolu, Alan M. Frieze, Páll Melste...
ICPR
2000
IEEE
13 years 9 months ago
Piecewise Linear Two-Dimensional Warping
A new efficient dynamic programming (DP) algorithm for 2D elastic matching is proposed. The present DP algorithm requires by far less complexity than previous DPbased elastic mat...
Seiichi Uchida, Hiroaki Sakoe
VMV
2001
135views Visualization» more  VMV 2001»
13 years 6 months ago
Search Space Reduction in the Edge Based Stereo Correspondence
Usually, the stereo correspondence for a feature point in the first image is obtained by searching in a predefined region of the second image, based on the epipolar line and the m...
Payman Moallem, Karim Faez