Sciweavers

22 search results - page 3 / 5
» Symmetric Objects are Hardly Ambiguous
Sort
View
CVPR
2009
IEEE
15 years 2 months ago
Layered Graph Matching by Composite Cluster Sampling with Collaborative and Competitive Interactions
This paper studies a framework for matching an unknown number of corresponding structures in two images (shapes), motivated by detecting objects in cluttered background and lear...
Kun Zeng, Liang Lin, Song Chun Zhu, Xiaobai Liu
SODA
2010
ACM
214views Algorithms» more  SODA 2010»
14 years 4 months ago
A Fourier space algorithm for solving quadratic assignment problems
The quadratic assignment problem (QAP) is a central problem in combinatorial optimization. Several famous computationally hard tasks, such as graph matching, partitioning, and the...
Risi Kondor
EDBT
2012
ACM
291views Database» more  EDBT 2012»
11 years 9 months ago
Relevance search in heterogeneous networks
Conventional research on similarity search focuses on measuring the similarity between objects with the same type. However, in many real-world applications, we need to measure the...
Chuan Shi, Xiangnan Kong, Philip S. Yu, Sihong Xie...
CORR
2008
Springer
172views Education» more  CORR 2008»
13 years 7 months ago
Altruism in Congestion Games
This paper studies the effects of introducing altruistic agents into atomic congestion games. Altruistic behavior is modeled by a trade-off between selfish and social objectives. ...
Martin Hoefer, Alexander Skopalik
3DPVT
2006
IEEE
213views Visualization» more  3DPVT 2006»
14 years 1 months ago
Generalized RANSAC Framework for Relaxed Correspondence Problems
Finding correspondences between two (widely) separated views is essential for several computer vision tasks, such as structure and motion estimation and object recognition. In the...
Wei Zhang, Jana Kosecka