5138 search results - page 92 / 1028 » Randomized Algorithms for 3-SAT |
135
click to vote
COMPGEOM
2011
ACM
14 years 5 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
148
click to vote
SDM
2011
SIAM
14 years 4 months ago
2011
SIAM
Sparse principal component analysis (PCA) imposes extra constraints or penalty terms to the standard PCA to achieve sparsity. In this paper, we first introduce an efficient algor...
120
click to vote
SODA
2012
ACM
13 years 4 months ago
2012
ACM
We give a deterministic O(log n)n -time and space algorithm for the Shortest Vector Problem (SVP) of a lattice under any norm, improving on the previous best deterministic nO(n) -...
101
click to vote
KDD
2003
ACM
16 years 2 months ago
2003
ACM
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
103
click to vote
IPPS
2000
IEEE
15 years 6 months ago
2000
IEEE
In this paper we develop a variant of a previously proposed method the regenerative randomization method for the transient analysis of dependability performability models. The va...