3038 search results - page 162 / 608 » High-Speed Function Approximation |
161
click to vote
EUROCRYPT
1999
Springer
15 years 10 months ago
1999
Springer
Abstract. This work describes schemes for distributing between n servers the evaluation of a function f which is an approximation to a random function, such that only authorized su...
159
click to vote
ICS
1997
Tsinghua U.
15 years 10 months ago
1997
Tsinghua U.
This paper makes the case for the use of XOR-based placement functions for cache memories. It shows that these XOR-mapping schemes can eliminate many conflict misses for direct-ma...
159
Voted
VLDB
2002
ACM
15 years 5 months ago
2002
ACM
The cost of a query plan depends on many parameters, such as predicate selectivities and available memory, whose values may not be known at optimization time. Parametric query opt...
198
click to vote
TIT
2008
15 years 4 months ago
2008
Source coding theorems and Shannon rate-distortion functions were studied for the discrete-time Wiener process by Berger and generalized to nonstationary Gaussian autoregressive p...
125
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
Separate optimizations of logic and layout have been thoroughly studied in the past and are well documented for common benchmarks. However, to be competitive, modern circuit optim...