17185 search results - page 3176 / 3437 » Computational and Quantitative Studies |
182
click to vote
SWAT
2000
Springer
15 years 10 months ago
2000
Springer
Planar point location is among the most fundamental search problems in computational geometry. Although this problem has been heavily studied from the perspective of worst-case que...
195
click to vote
SC
1995
ACM
15 years 10 months ago
1995
ACM
The goal of this work is to explore architectural mechanisms for supporting explicit communication in cachecoherent shared memory multiprocessors. The motivation stems from the ob...
176
click to vote
SIGMOD
1995
ACM
15 years 10 months ago
1995
ACM
We study the problem of e cient maintenance of materialized views that may contain duplicates. This problem is particularly important when queries against such views involve aggre...
173
click to vote
LICS
1991
IEEE
15 years 10 months ago
1991
IEEE
We present an elementary axiomatisation of synthetic domain theory and show that it is sufficient to deduce the fixed point property and solve domain equations. Models of these a...
222
click to vote
STOC
2010
ACM
15 years 10 months ago
2010
ACM
We study the problem of "privacy amplification": key agreement between two parties who both know a weak secret w, such as a password. (Such a setting is ubiquitous on th...