3600 search results - page 477 / 720 » The settling-time reducibility ordering |
174
click to vote
ASIACRYPT
2000
Springer
15 years 11 months ago
2000
Springer
Abstract. A t out of n threshold scheme is such that shares are distributed to n participants so that any set of t participants can compute the secret, whereas any set of less than...
177
click to vote
DAC
1999
ACM
15 years 11 months ago
1999
ACM
Dynamic-current based test techniques can potentially address the drawbacks of traditional and Iddq test methodologies. The quality of dynamic current based test is degraded by pr...
155
click to vote
ECRTS
1999
IEEE
15 years 11 months ago
1999
IEEE
Scheduling decisions in time-critical systems are very difficult, due to the vast number of systems' parameters and tasks' attributes involved in such decisions. Due to ...
163
click to vote
SIGGRAPH
1999
ACM
15 years 11 months ago
1999
ACM
Bus traffic between the graphics subsystem and memory can become a bottleneck when rendering geometrically complex meshes. In this paper, we investigate the use of vertex caching...
165
click to vote
SIGMOD
1999
ACM
15 years 11 months ago
1999
ACM
Recovery can be extended to new domains at reduced logging cost by exploiting "logical" log operations. During recovery, a logical log operation may read data values fro...