165 search results - page 31 / 33 » Exotic Quantifiers, Complexity Classes, and Complete Problem... |
STOC
2004
ACM
14 years 7 months ago
2004
ACM
We prove an (lg n) cell-probe lower bound on maintaining connectivity in dynamic graphs, as well as a more general trade-off between updates and queries. Our bound holds even if t...
GECCO
2009
Springer
14 years 1 months ago
2009
Springer
A recent theoretical investigation of modular representations shows that certain modularizations can introduce a distance bias into a landscape. This was a static analysis, and em...
PODS
2002
ACM
14 years 7 months ago
2002
ACM
In multidimensional data models intended for online analytic processing (OLAP), data are viewed as points in a multidimensional space. Each dimension has structure, described by a...
ICDT
2010
ACM
14 years 4 months ago
2010
ACM
The work reported here lays the foundations of data exchange in the presence of probabilistic data. This requires rethinking the very basic concepts of traditional data exchange, ...
IJCAI
1997
13 years 8 months ago
1997
The class of algorithms for approximating reasoning tasks presented in this paper is based on approximating the general bucket elimination framework. The algorithms have adjustabl...