64 search results - page 4 / 13 » Algorithms for Secretary Problems on Graphs and Hypergraphs |
129
click to vote
STACS
2010
Springer
15 years 10 months ago
2010
Springer
In this paper we consider the problem of reconstructing a hidden weighted
hypergraph of constant rank using additive queries. We prove the following: Let G be
a weighted hidden h...
193
click to vote
CVPR
2009
IEEE
16 years 10 months 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...
143
click to vote
WAOA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. A strong vertex coloring of a hypergraph assigns distinct colors to vertices that are contained in a common hyperedge. This captures many previously studied graph colorin...
132
click to vote
COCOA
2008
Springer
15 years 5 months ago
2008
Springer
The multiple weighted hitting set problem is to find a subset of nodes in a hypergraph that hits every hyperedge in at least m nodes. We extend the problem to a notion of hypergra...
145
Voted
CVPR
2008
IEEE
16 years 5 months ago
2008
IEEE
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...