104 search results - page 14 / 21 » The Partition Bound for Classical Communication Complexity a... |
DEBS
2009
ACM
14 years 1 months ago
2009
ACM
Efficient matching of incoming events to persistent queries is fundamental to event pattern matching, complex event processing, and publish/subscribe systems. Recent processing e...
STACS
2005
Springer
14 years 26 days ago
2005
Springer
We define and study the complexity of robust polynomials for Boolean functions and the related fault-tolerant quantum decision trees, where input bits are perturbed by noise. We ...
MDM
2004
Springer
14 years 23 days ago
2004
Springer
In this paper, we consider a data model for uncertain trajectories of moving objects. In our model, the trajectory is a vector of uniform stochastic processes. We study “univers...
STOC
2003
ACM
14 years 7 months ago
2003
ACM
Given a database of n points in {0, 1}d, the partial match problem is: In response to a query x in {0, 1, }d, find a database point y such that for every i whenever xi = , we have...
PODS
2005
ACM
14 years 7 months ago
2005
ACM
We consider a scenario where we want to query a large dataset that is stored in external memory and does not fit into main memory. The most constrained resources in such a situati...