57 search results - page 2 / 12 » Probabilistic graph and hypergraph matching |
CVPR
2009
IEEE
15 years 17 days ago
2009
IEEE
This paper addresses the problem of establishing correspondences
between two sets of visual features using
higher-order constraints instead of the unary or pairwise
ones used in...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. This paper deals with approximations of maximum independent sets in non-uniform hypergraphs of low degree. We obtain the first performance ratio that is sublinear in term...
WG
1993
Springer
13 years 9 months ago
1993
Springer
Minimal perfect hash functions are used for memory efficient storage and fast retrieval of items from static sets. We present an infinite family of efficient and practical algori...
ICALP
2009
Springer
14 years 5 months ago
2009
Springer
We examine several online matching problems, with applications to Internet advertising reservation systems. Consider an edge-weighted bipartite graph G, with partite sets L, R. We...
IADIS
2003
13 years 6 months ago
2003
This article proposes an approach to the generation of guided tours over indexed information resources on user demand. It represents an alternative to more sophisticated hyperdocu...