563 search results - page 23 / 113 » Computing approximate PSD factorizations |
109
Voted
COMPUTING
2007
15 years 1 months ago
2007
Hierarchical matrices (H-matrices) approximate matrices in a data-sparse way, and the approximate arithmetic for H-matrices is almost optimal. In this paper we present an algebrai...
95
Voted
IPL
2010
14 years 11 months ago
2010
We show that the problem of computing a minimum distortion embedding of a given graph into a path remains NP-hard when the input graph is restricted to a bipartite, cobipartite, o...
130
Voted
JMLR
2011
14 years 8 months ago
2011
We consider the problem of improving the Gaussian approximate posterior marginals computed by expectation propagation and the Laplace method in latent Gaussian models and propose ...
121
Voted
FOCS
2004
IEEE
15 years 4 months ago
2004
IEEE
We consider a stochastic variant of the NP-hard 0/1 knapsack problem in which item values are deterministic and item sizes are independent random variables with known, arbitrary d...
ACCV
2006
Springer
15 years 7 months ago
2006
Springer
We propose a considerably faster approximation of the well known SIFT method. The main idea is to use efficient data structures for both, the detector and the descriptor. The detec...