563 search results - page 13 / 113 » Computing approximate PSD factorizations |
154
Voted
STOC
1999
ACM
15 years 5 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
107
Voted
INFOCOM
2007
IEEE
15 years 7 months ago
2007
IEEE
— Loss networks provide a powerful tool for the analysis and design of many communication and networking systems. It is well known that a large number of loss networks have produ...
108
Voted
AAAI
2008
15 years 3 months ago
2008
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
114
Voted
AIPS
2009
15 years 2 months ago
2009
When modeling real-world decision-theoretic planning problems in the Markov decision process (MDP) framework, it is often impossible to obtain a completely accurate estimate of tr...
101
Voted
ISSAC
2004
Springer
15 years 6 months ago
2004
Springer
A recent algorithmic procedure for computing the absolute factorization of a polynomial P(X, Y ), after a linear change of coordinates, is via a factorization modulo X3 . This was...