517 search results - page 18 / 104 » An Approximate Algorithm for Structural Matching of Images |
KDD
2009
ACM
14 years 8 months ago
2009
ACM
We propose two approximation algorithms for identifying communities in dynamic social networks. Communities are intuitively characterized as "unusually densely knit" sub...
ACIVS
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. Most existing feature-point matching algorithms rely on photometric region descriptors to distinct and match feature points in two images. In this paper, we propose an eï...
CVPR
2005
IEEE
14 years 1 months ago
2005
IEEE
In this paper, we propose a symmetric stereo model to handle occlusion in dense two-frame stereo. Our occlusion reasoning is directly based on the visibility constraint that is mo...
ECCV
2006
Springer
14 years 9 months ago
2006
Springer
We propose a fast algorithm, EMD-L1, for computing the Earth Mover's Distance (EMD) between a pair of histograms. Compared to the original formulation, EMD-L1 has a largely si...
DISOPT
2006
13 years 8 months ago
2006
We consider the multiple shift scheduling problem modelled as a covering problem. Such problems are characterized by a constraint matrix that has in every column blocks of consecu...