Sciweavers

4850 search results - page 155 / 970
» Proof and Computation in Geometry
Sort
View
COMPGEOM
2004
ACM
15 years 12 months ago
The geometric thickness of low degree graphs
We prove that the geometric thickness of graphs whose maximum degree is no more than four is two. In our proofs, we present a space and time efficient embedding technique for gra...
Christian A. Duncan, David Eppstein, Stephen G. Ko...
FOCS
1999
IEEE
15 years 10 months ago
A Study of Proof Search Algorithms for Resolution and Polynomial Calculus
This paper is concerned with the complexity of proofs and of searching for proofs in two propositional proof systems: Resolution and Polynomial Calculus (PC). For the former syste...
Maria Luisa Bonet, Nicola Galesi
COMPGEOM
2009
ACM
16 years 1 months ago
Proximity of persistence modules and their diagrams
Topological persistence has proven to be a key concept for the study of real-valued functions defined over topological spaces. Its validity relies on the fundamental property tha...
Frédéric Chazal, David Cohen-Steiner...
IMAMS
2007
245views Mathematics» more  IMAMS 2007»
15 years 8 months ago
Discrete Surface Ricci Flow: Theory and Applications
Conformal geometry is in the core of pure mathematics. Conformal structure is more flexible than Riemaniann metric but more rigid than topology. Conformal geometric methods have p...
Miao Jin, Junho Kim, Xianfeng David Gu
COMPGEOM
2011
ACM
14 years 10 months ago
Persistence-based clustering in riemannian manifolds
We present a clustering scheme that combines a mode-seeking phase with a cluster merging phase in the corresponding density map. While mode detection is done by a standard graph-b...
Frédéric Chazal, Leonidas J. Guibas,...