729 search results - page 9 / 146 » Computing persistent homology |
OOPSLA
1999
Springer
15 years 1 months ago
1999
Springer
We describe how reachability-based orthogonal persistence can be supported even in uncooperative implementations of languages such as C++ and Modula-3, and without modification t...
CASC
2006
Springer
15 years 1 months ago
2006
Springer
Homological Perturbation Theory [11, 13] is a well-known general method for computing homology, but its main algorithm, the Basic Perturbation Lemma, presents, in general, high com...
COMPGEOM
2010
ACM
15 years 2 months ago
2010
ACM
Sampling conditions for recovering the homology of a set using topological persistence are much weaker than sampling conditions required by any known algorithm for producing a top...
85
Voted
GCB
2009
Springer
15 years 4 months ago
2009
Springer
: Genome annotation relies to a large extent on the recognition of homologs to already known genes. The starting point for such protocols is a collection of known sequences from on...
DGCI
2005
Springer
15 years 3 months ago
2005
Springer
Topological invariants are extremely useful in many applications related to digital imaging and geometric modeling, and homology is a classical one, which has not yet been fully e...