3713 search results - page 311 / 743 » Quantum Information Theory |
158
click to vote
CC
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. We prove lower bounds on the randomized two-party communication complexity of functions that arise from read-once boolean formulae. A read-once boolean formula is a formu...
114
Voted
ELECTRONICMARKETS
2010
14 years 10 months ago
2010
We argue that certain theoretical commitments that underpin much existing Interorganisational Information Systems (IOIS) research at small scales become untenable when IOIS are st...
100
Voted
ATAL
2011
Springer
14 years 24 days ago
2011
Springer
Motivated by a machine learning perspective—that gametheoretic equilibria constraints should serve as guidelines for predicting agents’ strategies, we introduce maximum causal...
124
Voted
Lab
Neural Systems Engineering Lab (NSEL) at Michigan State University focuses on advancing neuroinformatics science by engineering new theoretical, computational and experimental tool...
STOC
2009
ACM
16 years 1 months ago
2009
ACM
We show by means of several examples that robust statistical estimators present an excellent starting point for differentially private estimators. Our algorithms use a new paradig...