Sciweavers

2412 search results - page 169 / 483
» Which Problems Have Strongly Exponential Complexity
Sort
View
125
Voted
CCS
2008
ACM
15 years 5 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
119
Voted
ICALP
2009
Springer
15 years 10 months ago
Names Trump Malice: Tiny Mobile Agents Can Tolerate Byzantine Failures
Abstract. We introduce a new theoretical model of ad hoc mobile computing in which agents have severely restricted memory, highly unpredictable movement and no initial knowledge of...
Rachid Guerraoui, Eric Ruppert
149
Voted
SRDS
2007
IEEE
15 years 9 months ago
Activity Monitoring to Guarantee File Availability in Structured P2P File-sharing Systems
A cooperative structured peer-to-peer file-sharing system requires that the nodes participating in the system need to maintain the location mappings of other nodes. However, the s...
Guowei Huang, Zhi Chen, Qi Zhao, Gongyi Wu
DATE
2006
IEEE
111views Hardware» more  DATE 2006»
15 years 9 months ago
Disclosing the LDPC code decoder design space
The design of future communication systems with high throughput demands will become a critical task, especially when sophisticated channel coding schemes have to be applied. LDPC ...
Torben Brack, Frank Kienle, Norbert Wehn
150
Voted
AGILEDC
2004
IEEE
15 years 7 months ago
Taming the Embedded Tiger - Agile Test Techniques for Embedded Software
Strong unit testing is the foundation of agile software development but embedded systems present special problems. Test of embedded software is bound up with test of hardware, cro...
Nancy Van Schooenderwoert, Ron Morsicato