1418 search results - page 99 / 284 » A Theory of Stream Queries |
SIGMOD
2005
ACM
14 years 9 months ago
2005
ACM
We review the notion of hypertree width, a measure of the degree of cyclicity of hypergraphs that is useful for identifying and solving efficiently easy instances of hard problems...
MST
2010
13 years 3 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...
SIGMOD
2003
ACM
14 years 9 months ago
2003
ACM
Increasingly pervasive networks are leading towards a world where data is constantly in motion. In such a world, conventional techniques for query processing, which were developed...
TREC
2004
13 years 10 months ago
2004
Our participation in TREC 2004 aims to extend and improve the use of the DFR (Divergence From Randomness) models with Query Expansion (QE) for the robust track. We experiment with...
ENTCS
2006
13 years 9 months ago
2006
Locality is a standard notion of finite model theory. There are two well known flavors of it, based on Hanf's and Gaifman's theorems. Essentially they say that structure...