5964 search results - page 868 / 1193 » A theory of speculative computation |
265
click to vote
PODC
2011
ACM
14 years 9 months ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
196
click to vote
ICCV
2011
IEEE
14 years 6 months ago
2011
IEEE
Compressive sampling (CS) aims at acquiring a signal at a sampling rate that is significantly below the Nyquist rate. Its main idea is that a signal can be decoded from incomplet...
187
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
We propose that the trust an agent places in another agent declaratively captures an architectural connector between the two agents. We formulate trust as a generic modality expre...
195
click to vote
CEC
2011
IEEE
14 years 6 months ago
2011
IEEE
Abstract—Memetics is a new science that has attracted increasing attentions in the recent decades. Beyond the formalism of simple hybrids, adaptive hybrids and memetic algorithms...
222
click to vote
IACR
2011
14 years 6 months ago
2011
Abstract. In Asiacrypt 2010, Groth constructed the only previously known sublinearcommunication NIZK argument for circuit satisfiability in the common reference string model. We p...