563 search results - page 12 / 113 » Computing approximate PSD factorizations |
103
Voted
AAAI
2012
13 years 3 months ago
2012
We consider the classic cake cutting problem where one allocates a divisible cake to n participating agents. Among all valid divisions, fairness and efficiency (a.k.a. social wel...
238
Voted
JMLR
2012
13 years 3 months ago
2012
This paper considers additive factorial hidden Markov models, an extension to HMMs where the state factors into multiple independent chains, and the output is an additive function...
119
Voted
GRC
2010
IEEE
15 years 1 months ago
2010
IEEE
We present a problem of factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, an...
113
click to vote
JMLR
2010
14 years 7 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
88
Voted
ICALP
2005
Springer
15 years 6 months ago
2005
Springer
We reduce the approximation factor for Vertex Cover to 2 − Θ( 1√ log n ) (instead of the previous 2 − Θ(log log n log n ), obtained by Bar-Yehuda and Even [2], and by Moni...