Sciweavers

609 search results - page 2 / 122
» Computation of Homology Groups and Generators
Sort
View
COCOON
2010
Springer
13 years 10 months ago
Tracking a Generator by Persistence
The persistent homology provides a mathematical tool to describe “features” in a principled manner. The persistence algorithm proposed by Edelsbrunner et al. [9] can compute n...
Oleksiy Busaryev, Tamal K. Dey, Yusu Wang
CORR
2008
Springer
118views Education» more  CORR 2008»
13 years 5 months ago
Quantifying Homology Classes
We develop a method for measuring homology classes. This involves three problems. First, we define the size of a homology class, using ideas from relative homology. Second, we defi...
Chao Chen, Daniel Freedman
CCA
2009
Springer
13 years 12 months ago
Computability of Homology for Compact Absolute Neighbourhood Retracts
In this note we discuss the information needed to compute the homology groups of a topological space. We argue that the natural class of spaces to consider are the compact absolut...
Pieter Collins
ESA
2010
Springer
248views Algorithms» more  ESA 2010»
13 years 6 months ago
The Robustness of Level Sets
We define the robustness of a level set homology class of a function f : X R as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theor...
Paul Bendich, Herbert Edelsbrunner, Dmitriy Morozo...
EJC
2002
13 years 5 months ago
Homology of Newtonian Coalgebras
Given a Newtonian coalgebra we associate to it a chain complex. The homology groups of this Newtonian chain complex are computed for two important Newtonian coalgebras arising in ...
Richard Ehrenborg, Margaret Readdy