2168 search results - page 139 / 434 » Randomized Algorithms and Complexity Theory |
175
click to vote
STOC
1996
ACM
15 years 7 months ago
1996
ACM
We use the Laplacian and power method to compute Betti numbers of simplicial complexes. This has a number of advantages over other methods, both in theory and in practice. It requ...
150
Voted
COMPGEOM
2011
ACM
14 years 7 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...
ECCC
2007
15 years 3 months ago
2007
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
137
click to vote
ALGORITHMICA
1999
15 years 3 months ago
1999
Maxima in Rd are found incrementally by maintaining a linked list and comparing new elements against the linked list. If the elements are independent and uniformly distributed in t...
107
click to vote
SMI
2007
IEEE
15 years 9 months ago
2007
IEEE
In this paper, we introduce localized homology, a theory for finding local geometric descriptions for topological attributes. Given a space and a cover of subspaces, we construct...