350 search results - page 21 / 70 » Lower and upper bounds on obtaining history independence |
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We give a tight lower bound of ( n) for the randomized one-way communication complexity of the Boolean Hidden Matching Problem [BJK04]. Since there is a quantum one-way communica...
190
click to vote
ICLP
2009
Springer
16 years 12 days ago
2009
Springer
Probabilistic logic programs (PLPs) define a set of probability distribution functions (PDFs) over the set of all Herbrand interpretations of the underlying logical language. When...
CDC
2010
IEEE
14 years 6 months ago
2010
IEEE
This paper studies iterative learning control (ILC) in a multi-agent framework. A group of agents simultaneously and repeatedly perform the same task. The agents improve their perf...
228
click to vote
INFOCOM
2012
IEEE
13 years 10 months ago
2012
IEEE
We derive bounds on the expected loss for authentication protocols in channels which are constrained due to noisy
conditions and communication costs. This is motivated by a
numbe...
104
click to vote
JMLR
2012
13 years 2 months ago
2012
We study sparse principal components analysis in the high-dimensional setting, where p (the number of variables) can be much larger than n (the number of observations). We prove o...