357 search results - page 39 / 72 » An Algebraic Approach to the Complexity of Generalized Conju... |
164
click to vote
IPSN
2009
Springer
16 years 25 days ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
324
click to vote
DIMACS
1996
15 years 7 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
196
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
In this paper we show that the (co)chain complex associated with a decomposition of the computational domain, commonly called a mesh in computational science and engineering, can b...
150
click to vote
CIKM
2009
Springer
16 years 19 days ago
2009
Springer
We introduce a new theoretical derivation, evaluation methods, and extensive empirical analysis for an automatic query expansion framework in which model estimation is cast as a r...
190
click to vote
DLOG
2008
15 years 8 months ago
2008
Answering queries posed over knowledge bases is a central problem in knowledge representation and database theory. In databases, query containment is one of the important query op...