2638 search results - page 194 / 528 » Random Geometric Complexes |
161
click to vote
CCA
2000
Springer
15 years 11 months ago
2000
Springer
The Exact Geometric Computing approach requires a zero test for numbers which are built up using standard operations starting with the natural numbers. The uniformity conjecture, ...
202
click to vote
ICIAP
1999
ACM
15 years 10 months ago
1999
ACM
Real-world tasks often require real-time performances. However, in many practical cases, “just in time” responses are sufficient. This means that a system should be efficien...
163
click to vote
ISPD
1998
ACM
15 years 10 months ago
1998
ACM
We propose a simple, isometry invariant pattern matching algorithm for an effective data reduction useful in layout-related data processing of very complex IC designs. The repeata...
209
click to vote
COMPGEOM
2005
ACM
15 years 8 months ago
2005
ACM
The persistence diagram of a real-valued function on a topological space is a multiset of points in the extended plane. We prove that under mild assumptions on the function, the p...
183
click to vote
AAECC
2010
Springer
15 years 6 months ago
2010
Springer
The aim of this paper is a comprehensive presentation of the geometrical tools which are necessary to prove the correctness of several up to date algorithms with intrinsic complex...