81 search results - page 3 / 17 » A Fast Random Sampling Algorithm for Sparsifying Matrices |
FOCS
2006
IEEE
14 years 9 days ago
2006
IEEE
We prove that the hit-and-run random walk is rapidly mixing for an arbitrary logconcave distribution starting from any point in the support. This extends the work of [26], where t...
ICRA
1995
IEEE
13 years 9 months ago
1995
IEEE
This paper describes and evaluates an efficient technique that allows the fast generation of 3D triangular meshes from range images avoiding optimization procedures. Such a tool ...
ICDM
2010
IEEE
13 years 4 months ago
2010
IEEE
Abstract--Randomization is a general technique for evaluating the significance of data analysis results. In randomizationbased significance testing, a result is considered to be in...
GD
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
EDBT
2006
ACM
13 years 8 months ago
2006
ACM
Random sampling is a well-known technique for approximate processing of large datasets. We introduce a set of algorithms for incremental maintenance of large random samples on seco...