Sciweavers

6274 search results - page 19 / 1255
» From query complexity to computational complexity
Sort
View
JCSS
2008
120views more  JCSS 2008»
13 years 9 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
ICDE
2008
IEEE
120views Database» more  ICDE 2008»
14 years 11 months ago
Sideways Information Passing for Push-Style Query Processing
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...
Zachary G. Ives, Nicholas E. Taylor
CC
2007
Springer
108views System Software» more  CC 2007»
13 years 9 months ago
Communication vs. Computation
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...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
CVPR
2007
IEEE
14 years 12 months ago
Searching Video for Complex Activities with Finite State Models
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...
Nazli Ikizler, David A. Forsyth
FCT
2005
Springer
14 years 3 months ago
On the Black-Box Complexity of Sperner's Lemma
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 ...
Katalin Friedl, Gábor Ivanyos, Miklos Santh...