563 search results - page 22 / 113 » Computing approximate PSD factorizations |
120
Voted
ECCV
2006
Springer
16 years 3 months ago
2006
Springer
Filtering based algorithms have become popular in tracking human body pose. Such algorithms can suffer the curse of dimensionality due to the high dimensionality of the pose state ...
131
Voted
FOCS
2008
IEEE
15 years 2 months ago
2008
IEEE
In this paper we consider the following maximum budgeted allocation (MBA) problem: Given a set of m indivisible items and n agents; each agent i willing to pay bij on item j and w...
131
Voted
FOCS
2009
IEEE
15 years 7 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
122
Voted
WG
2007
Springer
15 years 7 months ago
2007
Springer
A cycle cover of a graph is a set of cycles such that every vertex is part of exactly one cycle. An L-cycle cover is a cycle cover in which the length of every cycle is in the set ...
111
Voted
CORR
2010
Springer
15 years 1 months ago
2010
Springer
We exhibit incentive compatible multi-unit auctions that are not affine maximizers (i.e. are not of the VCG family) and yet approximate the social welfare to within a factor of 1 ...