5964 search results - page 1154 / 1193 » A theory of speculative computation |
113
Voted
FPCA
1989
15 years 4 months ago
1989
We give a framework for denotational semantics for the polymorphic “core” of the programming language ML. This framework requires no more semantic material than what is needed...
105
Voted
ACMICEC
2007
ACM
15 years 4 months ago
2007
ACM
We investigate asymptotically optimal keyword auctions, that is, auctions which maximize revenue as the number of bidders grows. We do so under two alternative behavioral assumpti...
102
Voted
COMPGEOM
2007
ACM
15 years 4 months ago
2007
ACM
We propose a simple variant of kd-trees, called rank-based kd-trees, for sets of points in Rd . We show that a rank-based kd-tree, like an ordinary kd-tree, supports range search ...
147
Voted
DIALM
2007
ACM
15 years 4 months ago
2007
ACM
Sketches--data structures for probabilistic, duplicate insensitive counting--are central building blocks of a number of recently proposed network protocols, for example in the con...
104
click to vote
ESORICS
2007
Springer
15 years 4 months ago
2007
Springer
We propose the role-and-relation-based access control (R2 BAC) model for workflow systems. In R2 BAC, in addition to a user's role memberships, the user's relationships w...