Sciweavers

5084 search results - page 733 / 1017
» Proving Possibility Properties
Sort
View
PET
2005
Springer
16 years 5 days ago
Anonymity Preserving Techniques in Trust Negotiations
Trust negotiation between two subjects require each one proving its properties to the other. Each subject specifies disclosure policies stating the types of credentials and attrib...
Indrakshi Ray, Elisa Bertino, Anna Cinzia Squiccia...
COMPGEOM
2010
ACM
15 years 11 months ago
Kinetic stable Delaunay graphs
The best known upper bound on the number of topological changes in the Delaunay triangulation of a set of moving points in R2 is (nearly) cubic, even if each point is moving with ...
Pankaj K. Agarwal, Jie Gao, Leonidas J. Guibas, Ha...
182
Voted
LICS
2002
IEEE
15 years 11 months ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
SIGECOM
2010
ACM
147views ECommerce» more  SIGECOM 2010»
15 years 11 months ago
Socially desirable approximations for Dodgson's voting rule
In 1876 Charles Lutwidge Dodgson suggested the intriguing voting rule that today bears his name. Although Dodgson’s rule is one of the most well-studied voting rules, it suffers...
Ioannis Caragiannis, Christos Kaklamanis, Nikos Ka...
168
Voted
ICALP
2010
Springer
15 years 11 months ago
A Topological Approach to Recognition
We propose a new approach to the notion of recognition, which departs from the classical definitions by three specific features. First, it does not rely on automata. Secondly, it...
Mai Gehrke, Serge Grigorieff, Jean-Eric Pin