7106 search results - page 83 / 1422 » Restricted Complexity, General Complexity |
JACM
2000
13 years 9 months ago
2000
A deterministic algorithm for computing a minimum spanning tree of a connected graph is presented. Its running time is O(m (m, n)), where is the classical functional inverse of Ack...
COLOGNETWENTE
2010
13 years 8 months ago
2010
In this paper we analyze O’Hara’s partition bijection. We present three type of results. First, we show that O’Hara’s bijection can be viewed geometrically as a certain sci...
DEBS
2011
ACM
2011
ACM
DejaVu: a complex event processing system for pattern matching over live and historical data streams
13 years 1 months ago
This short paper provides an overview of the DejaVu complex event processing (CEP) system, with an emphasis on its novel architecture and query optimization techniques for correla...
FUN
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
ECAI
2004
Springer
14 years 3 months ago
2004
Springer
Distributed constraint satisfaction, in its most general acceptation, involves a collection of agents solving local constraint satisfaction subproblems, and a communication protoco...