Sciweavers

2638 search results - page 173 / 528
» Random Geometric Complexes
Sort
View
SGP
2004
15 years 8 months ago
Persistence Barcodes for Shapes
In this paper, we initiate a study of shape description and classification via the application of persistent homology to tangential constructions on geometric objects. Our techniq...
Gunnar Carlsson, Afra Zomorodian, Anne D. Collins,...
TCOM
2010
109views more  TCOM 2010»
15 years 4 months ago
Results on Finite Wireless Networks on a Line
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
Ali Eslami, Mohammad Nekoui, Hossein Pishro-Nik
ISPDC
2007
IEEE
16 years 22 days ago
On Grid-based Matrix Partitioning for Heterogeneous Processors
The problem of optimal matrix partitioning for parallel linear algebra on p heterogeneous processors is typically reduced to the geometrical problem of partitioning a unit square ...
Alexey L. Lastovetsky
SIGGRAPH
2000
ACM
15 years 10 months ago
Out-of-core simplification of large polygonal models
We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme o...
Peter Lindstrom
SIGGRAPH
1995
ACM
15 years 10 months ago
Versatile and efficient techniques for simulating cloth and other deformable objects
We are presenting techniques for simulating the motion and the deformation of cloth, fabrics or, more generally, deformable surfaces. Our main goal is to be able to simulate any k...
Pascal Volino, Martin Courchesne, Nadia Magnenat-T...