Sciweavers

78 search results - page 2 / 16
» An Incremental Algorithm for Betti Numbers of Simplicial Com...
Sort
View
WABI
2001
Springer
124views Bioinformatics» more  WABI 2001»
13 years 11 months ago
Computing Linking Numbers of a Filtration
We develop fast algorithms for computing the linking number of a simplicial complex within a filtration. We give experimental results in applying our work toward the detection of...
Herbert Edelsbrunner, Afra Zomorodian
DCG
2008
69views more  DCG 2008»
13 years 7 months ago
On Projections of Semi-Algebraic Sets Defined by Few Quadratic Inequalities
Let S Rk+m be a compact semi-algebraic set defined by P1 0, . . . , P 0, where Pi R[X1, . . . , Xk, Y1, . . . , Ym], and deg(Pi) 2, 1 i . Let denote the standard projection f...
Saugata Basu, Thierry Zell
IDA
2002
Springer
13 years 6 months ago
Classification with sparse grids using simplicial basis functions
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
Jochen Garcke, Michael Griebel
KDD
2001
ACM
192views Data Mining» more  KDD 2001»
14 years 7 months ago
Data mining with sparse grids using simplicial basis functions
Recently we presented a new approach [18] to the classification problem arising in data mining. It is based on the regularization network approach but, in contrast to other method...
Jochen Garcke, Michael Griebel
IMR
2004
Springer
14 years 7 days ago
Efficient Spacetime Meshing with Nonlocal Cone Constraints
Spacetime Discontinuous Galerkin (DG) methods are used to solve hyperbolic PDEs describing wavelike physical phenomena. When the PDEs are nonlinear, the speed of propagation of th...
Shripad Thite