Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

80

Voted

COMPGEOM
2010
ACM

favoriteEmaildiscussreport

147views Discrete Geometry» more COMPGEOM 2010»

The tidy set: a minimal simplicial set for computing homology of clique complexes

15 years 4 months ago

The tidy set: a minimal simplicial set for computing homology of clique complexes

Download www.cs.dartmouth.edu

Afra Zomorodian

Real-time Traffic

COMPGEOM 2010 |

claim paper

Related Content

» Approximating loops in a shortest homology basis from point data

» Reeb graphs approximation and persistence

» Classification with sparse grids using simplicial basis functions

Post Info
More Details (n/a)

Added	10 Jul 2010
Updated	10 Jul 2010
Type	Conference
Year	2010
Where	COMPGEOM
Authors	Afra Zomorodian

Comments (0)