4212 search results - page 608 / 843 » On Compressible Pairings and Their Computation |
190
click to vote
SENSYS
2003
ACM
15 years 12 months ago
2003
ACM
Wireless ad-hoc sensor networks have emerged as an interesting and important research area in the last few years. The applications envisioned for such networks require collaborati...
168
click to vote
CRYPTO
2000
Springer
15 years 11 months ago
2000
Springer
In this work we use cryptography to solve a game-theoretic problem which arises naturally in the area of two party strategic games. The standard game-theoretic solution concept for...
155
click to vote
PODS
1999
ACM
15 years 11 months ago
1999
ACM
Query optimizers rely on fast, high-quality estimates of result sizes in order to select between various join plans. Selfjoin sizes of relations provide bounds on the join size of...
159
Voted
CTRS
1990
15 years 10 months ago
1990
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
187
click to vote
FPCA
1989
15 years 10 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...