1274 search results - page 107 / 255 » New Proofs for |
FOCS
2008
IEEE
14 years 4 months ago
2008
IEEE
We show that the combinatorial complexity of the union of n infinite cylinders in R3 , having arbitrary radii, is O(n2+ε ), for any ε > 0; the bound is almost tight in the w...
CLEIEJ
2006
13 years 10 months ago
2006
Concurrent process calculi are powerful formalisms for modelling concurrent systems. The mathematical style underlying process calculi allow to both model and verify properties of...
EUROCRYPT
2008
Springer
14 years 10 hour ago
2008
Springer
ded abstract of this paper appears in Advances in Cryptology -- EUROCRYPT '08, Lecture Notes in Computer Science Vol. 4965, N. Smart ed., Springer-Verlag, 2008. This is the fu...
CSL
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. Recent analysis of sequential algorithms resulted in their axiomatization and in a representation theorem stating that, for any sealgorithm, there is an abstract state ma...
DCG
2010
13 years 10 months ago
2010
We present a Delaunay refinement algorithm for meshing a piecewise smooth complex in three dimensions. The algorithm protects edges with weighted points to avoid the difficulty po...