Sciweavers

43 search results - page 7 / 9
» Persistent Intersection Homology
Sort
View
COMPGEOM
2010
ACM
14 years 15 days ago
Optimal reconstruction might be hard
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...
Dominique Attali, André Lieutier
PADL
2010
Springer
14 years 4 months ago
First-Order Interactive Programming
Abstract. Interactive programming is a method for implementing programming languages that supports an interactive, exploratory style of program development and debugging. The basic...
Roly Perera
COMPGEOM
2009
ACM
14 years 1 months ago
Persistent cohomology and circular coordinates
Nonlinear dimensionality reduction (NLDR) algorithms such as Isomap, LLE and Laplacian Eigenmaps address the problem of representing high-dimensional nonlinear data in terms of lo...
Vin de Silva, Mikael Vejdemo-Johansson
SSDBM
2002
IEEE
149views Database» more  SSDBM 2002»
14 years 10 days ago
A Cost Model for Interval Intersection Queries on RI-Trees
The efficient management of interval data represents a core requirement for many temporal and spatial database applications. With the Relational Interval Tree (RI-tree1 ), an effi...
Hans-Peter Kriegel, Martin Pfeifle, Marco Pöt...
COMPGEOM
2008
ACM
13 years 9 months ago
Towards persistence-based reconstruction in euclidean spaces
Manifold reconstruction has been extensively studied for the last decade or so, especially in two and three dimensions. Recent advances in higher dimensions have led to new method...
Frédéric Chazal, Steve Oudot