Sciweavers

57 search results - page 10 / 12
» Probabilistic graph and hypergraph matching
Sort
View
SODA
2010
ACM
185views Algorithms» more  SODA 2010»
13 years 6 months ago
Solving MAX-r-SAT Above a Tight Lower Bound
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
Noga Alon, Gregory Gutin, Eun Jung Kim, Stefan Sze...
ECCV
2010
Springer
14 years 2 days ago
From a Set of Shapes to Object Discovery
Abstract. This paper presents an approach to object discovery in a given unlabeled image set, based on mining repetitive spatial configurations of image contours. Contours that si...
CORR
2011
Springer
168views Education» more  CORR 2011»
12 years 11 months ago
Link Prediction by De-anonymization: How We Won the Kaggle Social Network Challenge
— This paper describes the winning entry to the IJCNN 2011 Social Network Challenge run by Kaggle.com. The goal of the contest was to promote research on realworld link predictio...
Arvind Narayanan, Elaine Shi, Benjamin I. P. Rubin...
CVPR
2004
IEEE
14 years 9 months ago
Motion Estimation by Swendsen-Wang Cuts
Our paper has two main contributions. Firstly, it presents a model for image sequences motivated by an image encoding perspective. It models accreted regions, where objects appear...
Adrian Barbu, Alan L. Yuille
FCT
2005
Springer
14 years 1 months ago
On the Black-Box Complexity of Sperner's Lemma
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...