9842 search results - page 445 / 1969 » The Complexity of the Matching-Cut Problem |
206
click to vote
PVLDB
2010
15 years 5 months ago
2010
Uncertain data streams are increasingly common in real-world deployments and monitoring applications require the evaluation of complex queries on such streams. In this paper, we c...
224
click to vote
LICS
2010
IEEE
15 years 5 months ago
2010
IEEE
The universal-algebraic approach has proved a powerful tool in the study of the computational complexity of constraint satisfaction problems (CSPs). This approach has previously b...
241
Voted
PKDD
2010
Springer
15 years 5 months ago
2010
Springer
Abstract. We present an implementation of model-based online reinforcement learning (RL) for continuous domains with deterministic transitions that is specifically designed to achi...
219
Voted
SODA
2012
ACM
13 years 9 months ago
2012
ACM
We present new quantum algorithms for Boolean Matrix Multiplication in both the time complexity and the query complexity settings. As far as time complexity is concerned, our resu...
202
click to vote
CC
2007
Springer
15 years 7 months ago
2007
Springer
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...