54 search results - page 2 / 11 » The Complexity of Perfect Matching Problems on Dense Hypergr... |
CVPR
2008
IEEE
14 years 6 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 ...
CC
2006
Springer
13 years 4 months ago
2006
Springer
Given a k-uniform hypergraph, the Maximum k-Set Packing problem is to find the maximum disjoint set of edges. We prove that this problem cannot be efficiently approximated to with...
APPROX
2008
Springer
13 years 6 months ago
2008
Springer
We consider the problem of max-min fair allocation of indivisible goods. Our focus will be on the restricted version of the problem in which there are m items, each of which assoc...
ISAAC
2007
Springer
13 years 11 months ago
2007
Springer
Valiant introduced some 25 years ago an algebraic model of computation along with the complexity classes VP and VNP, which can be viewed as analogues of the classical classes P and...
AOSD
2003
ACM
13 years 10 months ago
2003
ACM
From the early days of object-oriented programming, the model-view-controller paradigm has been pursued for a clear design which separates different responsibilities within an in...