1058 search results - page 96 / 212 » It's Doomed; We Can Prove It |
CAV
2001
Springer
15 years 2 months ago
2001
Springer
Regular languages have proved useful for the symbolic state exploration of infinite state systems. They can be used to represent infinite sets of system configurations; the tran...
112
click to vote
ASIACRYPT
2004
Springer
15 years 1 months ago
2004
Springer
Group signature schemes are cryptographic systems that provide revocable anonymity for signers. We propose a group signature scheme with constant-size public key and signature leng...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
The fundamental principle underlying compressed sensing is that a signal, which is sparse under some basis representation, can be recovered from a small number of linear measuremen...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Researchers in transactional memory (TM) have proposed open nesting as a methodology for increasing the concurrency of transactional programs. The idea is to ignore "low-leve...
JSAC
2006
14 years 10 months ago
2006
Abstract--The current framework of network utility maximization for rate allocation and its price-based algorithms assumes that each link provides a fixed-size transmission "p...