563 search results - page 18 / 113 » Computing approximate PSD factorizations |
78
Voted
SIAMNUM
2010
14 years 7 months ago
2010
We discuss and compare two greedy algorithms, that compute discrete versions of Fekete-like points for multivariate compact sets by basic tools of numerical linear algebra. The fi...
100
Voted
WWW
2005
ACM
16 years 1 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
121
Voted
SODA
1992
ACM
15 years 2 months ago
1992
ACM
We show that the length of the minimum weight Steiner triangulation (MWST) of a point set can be approximated within a constant factor by a triangulation algorithm based on quadtr...
152
Voted
COMGEO
2002
ACM
15 years 26 days ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
145
Voted
SIGIR
2004
ACM
15 years 6 months ago
2004
ACM
We present a probabilistic model for a document corpus that combines many of the desirable features of previous models. The model is called “GaP” for Gamma-Poisson, the distri...