Sciweavers

3946 search results - page 774 / 790
» The computational complexity of choice sets
Sort
View
ASYNC
2000
IEEE
122views Hardware» more  ASYNC 2000»
15 years 4 months ago
DUDES: A Fault Abstraction and Collapsing Framework for Asynchronous Circuits
Fault Abstraction and Collapsing Framework for Asynchronous Circuits Philip P. Shirvani, Subhasish Mitra Center for Reliable Computing Stanford University Stanford, CA Jo C. Eberge...
Philip P. Shirvani, Subhasish Mitra, Jo C. Ebergen...
94
Voted
ASPLOS
2000
ACM
15 years 4 months ago
Architectural Support for Fast Symmetric-Key Cryptography
The emergence of the Internet as a trusted medium for commerce and communication has made cryptography an essential component of modern information systems. Cryptography provides ...
Jerome Burke, John McDonald, Todd M. Austin
132
Voted
COBUILD
1998
Springer
15 years 3 months ago
An Agent-Based Telecooperation Framework
Abstract. As the amount of information and communication increases dramatically new working environments must provide efficient mechanisms to maximize the benefits of these develop...
Albrecht Schmidt, Alexander Specker, Gerhard Parts...
APLAS
2007
ACM
15 years 3 months ago
Scalable Simulation of Cellular Signaling Networks
Abstract. Given the combinatorial nature of cellular signalling pathways, where biological agents can bind and modify each other in a large number of ways, concurrent or agent-base...
Vincent Danos, Jérôme Feret, Walter F...
CIKM
2007
Springer
15 years 3 months ago
A segment-based hidden markov model for real-setting pinyin-to-chinese conversion
Hidden markov model (HMM) is frequently used for Pinyin-toChinese conversion. But it only captures the dependency with the preceding character. Higher order markov models can brin...
Xiaohua Zhou, Xiaohua Hu, Xiaodan Zhang, Xiajiong ...