1058 search results - page 96 / 212 » It's Doomed; We Can Prove It |
166
click to vote
CAV
2001
Springer
15 years 11 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...
205
click to vote
ASIACRYPT
2004
Springer
15 years 10 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...
157
click to vote
CORR
2010
Springer
15 years 6 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...
164
click to vote
PPOPP
2009
ACM
16 years 6 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...
180
click to vote
JSAC
2006
15 years 6 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...