130 search results - page 10 / 26 » Optimal Lower Bounds on Regular Expression Size Using Commun... |
209
Voted
VLDB
2007
ACM
16 years 3 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...
120
Voted
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— Designing optimal measurement infrastructure is a key step for network management. In this work we address the problem of optimizing a scalable distributed polling system. The ...
130
Voted
IANDC
2006
15 years 3 months ago
2006
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
129
click to vote
JC
2007
15 years 3 months ago
2007
We study the complexity of approximating the smallest eigenvalue of −∆ + q with Dirichlet boundary conditions on the d-dimensional unit cube. Here ∆ is the Laplacian, and th...
239
Voted
ICDE
2003
IEEE
16 years 5 months ago
2003
IEEE
Expressing complex OLAP queries using group-by, aggregation, and joins can be extremely difficult. As a result of this, many alternate ways of expressing such queries have been de...