Sciweavers

35419 search results - page 7032 / 7084
» How are we doing
Sort
View
123
Voted
STOC
1997
ACM
125views Algorithms» more  STOC 1997»
15 years 7 months ago
An Interruptible Algorithm for Perfect Sampling via Markov Chains
For a large class of examples arising in statistical physics known as attractive spin systems (e.g., the Ising model), one seeks to sample from a probability distribution π on an...
James Allen Fill
117
Voted
ECBS
1996
IEEE
93views Hardware» more  ECBS 1996»
15 years 7 months ago
A Methodology for Designing and Dimensioning Critical Complex Computing Systems
It is widely recognized that real-time,fault-tolerant and distributed computing technologies play a key role in the deployment of many current andfuture (civilian or Defense) crit...
Gérard Le Lann
137
Voted
FSE
1997
Springer
131views Cryptology» more  FSE 1997»
15 years 7 months ago
Fast Software Encryption: Designing Encryption Algorithms for Optimal Software Speed on the Intel Pentium Processor
Most encryption algorithms are designed without regard to their performance on top-of-the-line microprocessors. This paper discusses general optimization principles algorithms desi...
Bruce Schneier, Doug Whiting
128
Voted
ICCAD
1993
IEEE
101views Hardware» more  ICCAD 1993»
15 years 7 months ago
Convexity-based algorithms for design centering
A new technique for design centering, and for polytope approximation of the feasible region for a design are presented. In the rst phase, the feasible region is approximated by a ...
Sachin S. Sapatnekar, Pravin M. Vaidya, Steve M. K...
178
Voted
HT
1993
ACM
15 years 7 months ago
Concurrency Control in Collaborative Hypertext Systems
Traditional concurrency control techniques for database systems (transaction management based on locking protocols) have been successful in many multiuser settings, but these tech...
Uffe Kock Wiil, John J. Leggett
« Prev « First page 7032 / 7084 Last » Next »