Sciweavers

3368 search results - page 18 / 674
» The Complexity of Query Reliability
Sort
View
COCO
2004
Springer
118views Algorithms» more  COCO 2004»
14 years 28 days ago
Graph Properties and Circular Functions: How Low Can Quantum Query Complexity Go?
In decision tree models, considerable attention has been paid on the effect of symmetry on computational complexity. That is, for a permutation group Γ, how low can the complexit...
Xiaoming Sun, Andrew Chi-Chih Yao, Shengyu Zhang
ICDE
2007
IEEE
99views Database» more  ICDE 2007»
14 years 9 months ago
Complex Group-By Queries for XML
Chaitanya Gokhale, Nitin Gupta 0003, Pranav Kumar,...
COCO
2004
Springer
121views Algorithms» more  COCO 2004»
14 years 28 days ago
Lower Bounds for Randomized and Quantum Query Complexity Using Kolmogorov Arguments
We prove a very general lower bound technique for quantum and randomized query complexity, that is easy to prove as well as to apply. To achieve this, we introduce the use of Kolm...
Sophie Laplante, Frédéric Magniez
APPROX
2008
Springer
75views Algorithms» more  APPROX 2008»
13 years 9 months ago
On the Query Complexity of Testing Orientations for Being Eulerian
We consider testing directed graphs for being Eulerian in the orientation model introduced in [15]. Despite the local nature of the property of being Eulerian, it turns out to be ...
Eldar Fischer, Oded Lachish, Ilan Newman, Arie Mat...
DMSN
2010
ACM
13 years 5 months ago
Processing nested complex sequence pattern queries over event streams
Complex event processing (CEP) has become increasingly important for tracking and monitoring applications ranging from health care, supply chain management to surveillance. These ...
Mo Liu, Medhabi Ray, Elke A. Rundensteiner, Daniel...