Sciweavers

922 search results - page 160 / 185
» On a Generalization of the Stone-Weierstrass Theorem
Sort
View
ASIAN
2006
Springer
134views Algorithms» more  ASIAN 2006»
15 years 5 months ago
Computational Soundness of Formal Indistinguishability and Static Equivalence
In the investigation of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [10], uses static equivalence from cryp...
Gergei Bana, Payman Mohassel, Till Stegers
CCCG
2010
15 years 3 months ago
On the variance of random polygons
A random polygon is the convex hull of uniformly distributed random points in a convex body K R2 . General upper bounds are established for the variance of the area of a random p...
William L. Steiger, Imre Bárány
102
Voted
IICAI
2007
15 years 3 months ago
Topologically Continuous Associative Memory: A Theoretical Foundation
We introduce a neural network with associative memory and a continuous topology, i.e. its processing units are elements of a continuous metric space and the state space is Euclide...
Enrique Carlos Segura
IJCAI
2003
15 years 3 months ago
Algorithms for Identifying Rigid Subsystems in Geometric Constraint Systems
The structural rigidity property, a generalization of Laman’s theorem which characterizes rigid bar frameworks in 2D, is generally considered a good approximation of rigidity in...
Christophe Jermann, Bertrand Neveu, Gilles Trombet...
GG
2010
Springer
15 years 3 months ago
Local Confluence for Rules with Nested Application Conditions
Abstract. Local confluence is an important property in many rewriting and transformation systems. The notion of critical pairs is central for being able to verify local confluence ...
Hartmut Ehrig, Annegret Habel, Leen Lambers, Ferna...