Sciweavers

4666 search results - page 741 / 934
» Equations on Timed Languages
Sort
View
ASIACRYPT
2001
Springer
15 years 9 months ago
Responsive Round Complexity and Concurrent Zero-Knowledge
The number of communication rounds is a classic complexity measure for protocols; reducing round complexity is a major goal in protocol design. However, when the communication time...
Tzafrir Cohen, Joe Kilian, Erez Petrank
SPAA
1997
ACM
15 years 8 months ago
Pipelining with Futures
Pipelining has been used in the design of many PRAM algorithms to reduce their asymptotic running time. Paul, Vishkin, and Wagener (PVW) used the approach in a parallel implementat...
Guy E. Blelloch, Margaret Reid-Miller
FPGA
1997
ACM
118views FPGA» more  FPGA 1997»
15 years 8 months ago
Module Generation of Complex Macros for Logic-Emulation Applications
Logic emulation is a technique that uses dynamically reprogrammable systems for prototyping and design veri cation. Using an emulator, designers can realize designs through a soft...
Wen-Jong Fang, Allen C.-H. Wu, Duan-Ping Chen
ATAL
2006
Springer
15 years 8 months ago
Convergence analysis for collective vocabulary development
We study how decentralized agents can develop a shared vocabulary without global coordination. Answering this question can help us understand the emergence of many communication s...
Jun Wang, Les Gasser, Jim Houk
NIPS
2008
15 years 5 months ago
An ideal observer model of infant object perception
Before the age of 4 months, infants make inductive inferences about the motions of physical objects. Developmental psychologists have provided verbal accounts of the knowledge tha...
Charles Kemp, Fei Xu