5995 search results - page 837 / 1199 » Algorithmic Game Theory |
202
click to vote
TSMC
2010
15 years 1 months ago
2010
The original rough-set model is primarily concerned with the approximations of sets described by a single equivalence relation on a given universe. With granular computing point of...
238
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
We consider the model of random trees introduced by Devroye [SIAM J Comput 28, 409– 432, 1998]. The model encompasses many important randomized algorithms and data structures. T...
275
Voted
ICASSP
2011
IEEE
2011
IEEE
Analysis of the security of linear blinding techniques from an information theoretical point of view
14 years 10 months ago
We propose a novel model to characterize the security of linear blinding techniques. The proposed model relates the security of blinding to the possibility of estimating the blind...
208
click to vote
JSAC
2011
14 years 9 months ago
2011
—This paper studies the problem of scheduling in single-hop wireless networks with real-time traffic, where every packet arrival has an associated deadline and a minimum fractio...
169
click to vote
ATAL
2011
Springer
14 years 6 months ago
2011
Springer
This paper demonstrates a biologically- and psychologicallyinspired human-like computational memory focusing on the retrieval mechanisms – Spreading Activation and Compound Cue ...