3341 search results - page 169 / 669 » On Bounded Queries and Approximation |
FSE
2008
Springer
14 years 12 months ago
2008
Springer
HCTR was proposed by Wang, Feng and Wu in 2005. It is a mode of operation which provides a tweakable strong pseudorandom permutation. Though HCTR is quite an efficient mode, the au...
MIDDLEWARE
2009
Springer
15 years 4 months ago
2009
Springer
Abstract. Pervasive computing applications often entail continuous monitoring tasks, issuing persistent queries that return continuously updated views of the operational environmen...
CCCG
2010
14 years 11 months ago
2010
We present a data structure for efficient axis-aligned orthogonal range search on a set of n lines in a bounded plane. The algorithm requires O(log n + k) time in the worst case t...
151
click to vote
SIGMOD
2005
ACM
15 years 10 months ago
2005
ACM
The problem of estimating progress for long-running queries has recently been introduced. We analyze the characteristics of the progress estimation problem, from the perspective o...
COCO
2008
Springer
15 years 2 days ago
2008
Springer
![Amplifying ZPP^SAT[1] and the Two Queries Problem](https://www.sciweavers.org/files/imagecache/thumbnail/default/content.jpg "Amplifying ZPP^SAT[1] and the Two Queries Problem")
This paper shows a complete upward collapse in the Polynomial Hierarchy (PH) if for ZPP, two queries to a SAT oracle is equivalent to one query. That is, ZPPSAT[1] = ZPPSAT [2] = ...