Sciweavers

6274 search results - page 1 / 1255
» From query complexity to computational complexity
Sort
View
STOC
2012
ACM
221views Algorithms» more  STOC 2012»
11 years 7 months ago
From query complexity to computational complexity
We consider submodular optimization problems, and provide a general way of translating oracle inapproximability results arising from the symmetry gap technique to computational co...
Shahar Dobzinski, Jan Vondrák
COMAD
2009
13 years 5 months ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
DAGSTUHL
2006
13 years 6 months ago
Semidefinite programming characterization and spectral adversary method for quantum complexity with noncommuting unitary queries
Generalizing earlier work characterizing the quantum query complexity of computing a function of an unknown classical "black box" function drawn from some set of such bl...
Howard Barnum
SSDBM
2009
IEEE
174views Database» more  SSDBM 2009»
13 years 11 months ago
Optimization and Execution of Complex Scientific Queries over Uncorrelated Experimental Data
Scientific experiments produce large volumes of data represented as complex objects that describe independent events such as particle collisions. Scientific analyses can be express...
Ruslan Fomkin, Tore Risch
SIGMOD
2006
ACM
159views Database» more  SIGMOD 2006»
14 years 5 months ago
Flexible and efficient XML search with complex full-text predicates
Recently, there has been extensive research that generated a wealth of new XML full-text query languages, ranging from simple Boolean search to combining sophisticated proximity a...
Sihem Amer-Yahia, Emiran Curtmola, Alin Deutsch