4850 search results - page 276 / 970 » Proof and Computation in Geometry |
181
click to vote
STOC
1999
ACM
15 years 11 months ago
1999
ACM
We investigate the question of when a prover can aid a verifier to reliably compute a function faster than if the verifier were to compute the function on its own. Our focus is ...
171
click to vote
ESA
2006
Springer
15 years 10 months ago
2006
Springer
Lower envelopes are fundamental structures in computational geometry, which have many applications, such as computing general Voronoi diagrams and performing hidden surface removal...
201
click to vote
COMPGEOM
2011
ACM
14 years 10 months ago
2011
ACM
In this paper, we present the first output-sensitive algorithm to compute the persistence diagram of a filtered simplicial complex. For any Γ > 0, it returns only those homo...
211
click to vote
Lecture Notes
These lecture notes have been developed over several semesters with the assistance of students in the course. For many (most) results, only incomplete proofs are given. Gaps in the...
146
click to vote
FMCAD
2007
Springer
16 years 25 days ago
2007
Springer
— Craig interpolants are often used to approximate inductive invariants of transition systems. Arithmetic relationships between numeric variables require word-level interpolants,...