Sciweavers

155 search results - page 19 / 31
» A Comparison Between ACO Algorithms for the Set Covering Pro...
Sort
View
CVPR
2011
IEEE
13 years 2 months ago
Hyper-graph Matching via Reweighted Random Walks
Establishing correspondences between two feature sets is a fundamental issue in computer vision, pattern recognition, and machine learning. This problem can be well formulated as g...
Jungmin Lee (Seoul National University), Minsu Cho...
ATVA
2005
Springer
108views Hardware» more  ATVA 2005»
14 years 8 days ago
Multi-valued Model Checking Games
This work extends the game-based framework of µ-calculus model checking to the multi-valued setting. In multi-valued model checking a formula is interpreted over a Kripke structur...
Sharon Shoham, Orna Grumberg
ECCV
2004
Springer
14 years 8 months ago
Image Clustering with Metric, Local Linear Structure, and Affine Symmetry
Abstract. This paper addresses the problem of clustering images of objects seen from different viewpoints. That is, given an unlabelled set of images of n objects, we seek an unsup...
Jongwoo Lim, Jeffrey Ho, Ming-Hsuan Yang, Kuang-Ch...
STOC
2009
ACM
133views Algorithms» more  STOC 2009»
14 years 7 months ago
Near-perfect load balancing by randomized rounding
We consider and analyze a new algorithm for balancing indivisible loads on a distributed network with n processors. The aim is minimizing the discrepancy between the maximum and m...
Tobias Friedrich, Thomas Sauerwald
IJCV
2006
115views more  IJCV 2006»
13 years 6 months ago
Object Recognition as Many-to-Many Feature Matching
Object recognition can be formulated as matching image features to model features. When recognition is exemplar-based, feature correspondence is one-to-one. However, segmentation e...
M. Fatih Demirci, Ali Shokoufandeh, Yakov Keselman...