6274 search results - page 19 / 1255 » From query complexity to computational complexity |
139
Voted
JCSS
2008
15 years 2 months ago
2008
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...
222
click to vote
ICDE
2008
IEEE
16 years 4 months ago
2008
IEEE
In many modern data management settings, data is queried from a central node or nodes, but is stored at remote sources. In such a setting it is common to perform "pushstyle&qu...
119
Voted
CC
2007
Springer
15 years 2 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
117
Voted
CVPR
2007
IEEE
16 years 4 months ago
2007
IEEE
We describe a method of representing human activities that allows a collection of motions to be queried without examples, using a simple and effective query language. Our approach...
149
Voted
FCT
2005
Springer
15 years 8 months ago
2005
Springer
We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over ...