2124 search results - page 256 / 425 » Aggregating time partitions |
182
click to vote
DAM
2010
15 years 6 months ago
2010
We introduce H -join decompositions of graphs, indexed by a fixed bipartite graph H . These decompositions are based on a graph operation that we call H -join, which adds edges be...
265
click to vote
CP
2009
Springer
16 years 7 months ago
2009
Springer
This paper deals with the challenging problem of counting the number of solutions of a CSP, denoted #CSP. Recent progress have been made using search methods, such as BTD [15], whi...
227
click to vote
SIGMOD
2005
ACM
16 years 6 months ago
2005
ACM
We present a replication-based approach to fault-tolerant distributed stream processing in the face of node failures, network failures, and network partitions. Our approach aims t...
175
click to vote
MICRO
2007
IEEE
16 years 25 days ago
2007
IEEE
This paper describes FAST, a novel simulation methodology that can produce simulators that (i) are orders of magnitude faster than comparable simulators, (ii) are cycleaccurate, (...
183
click to vote
GRID
2007
Springer
16 years 21 days ago
2007
Springer
— Today’s system monitoring tools are capable of detecting system failures such as host failures, OS errors, and network partitions in near-real time. Unfortunately, the same c...