3415 search results - page 518 / 683 » Lower bounds on kernelization |
163
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
We present a range of new results for testing properties of Boolean functions that are defined in terms of the Fourier spectrum. Broadly speaking, our results show that the propert...
169
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
This paper shows how to build and maintain a distributed heap which we call SHELL. In contrast to standard heaps, our heap is oblivious in the sense that its structure only depends...
251
click to vote
VLDB
2007
ACM
16 years 6 months ago
2007
ACM
Estimating the cardinality (i.e. number of distinct elements) of an arbitrary set expression defined over multiple distributed streams is one of the most fundamental queries of in...
140
click to vote
PODS
2005
ACM
16 years 6 months ago
2005
ACM
We study the satisfiability problem associated with XPath in the presence of DTDs. This is the problem of determining, given a query p in an XPath fragment and a DTD D, whether or...
172
Voted
ICDE
2010
IEEE
16 years 5 months ago
2010
IEEE
Abstract-- This paper introduces a deterministic approximation algorithm with error guarantees for computing the probability of propositional formulas over discrete random variable...