Sciweavers

44 search results - page 9 / 9
» Exact Quantum Algorithms for the Leader Election Problem
Sort
View
JCSS
2008
120views more  JCSS 2008»
13 years 5 months ago
Quantum certificate complexity
Given a Boolean function f, we study two natural generalizations of the certificate complexity C (f): the randomized certificate complexity RC (f) and the quantum certificate comp...
Scott Aaronson
TIT
2008
83views more  TIT 2008»
13 years 5 months ago
Constrained Codes as Networks of Relations
We address the well-known problem of determining the capacity of constrained coding systems. While the onedimensional case is well understood to the extent that there are technique...
Moshe Schwartz, Jehoshua Bruck
SIGECOM
2010
ACM
149views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
A new understanding of prediction markets via no-regret learning
We explore the striking mathematical connections that exist between market scoring rules, cost function based prediction markets, and no-regret learning. We first show that any c...
Yiling Chen, Jennifer Wortman Vaughan
CORR
2012
Springer
183views Education» more  CORR 2012»
12 years 1 months ago
Learning Determinantal Point Processes
Determinantal point processes (DPPs), which arise in random matrix theory and quantum physics, are natural models for subset selection problems where diversity is preferred. Among...
Alex Kulesza, Ben Taskar