6181 search results - page 556 / 1237 » Transactional Cluster Computing |
183
click to vote
MST
2010
15 years 1 months ago
2010
Cluster Editing is transforming a graph by at most k edge insertions or deletions into a disjoint union of cliques. This problem is fixed-parameter tractable (FPT). Here we comput...
194
click to vote
ICIP
2006
IEEE
16 years 8 months ago
2006
IEEE
This paper presents an efficient three-step algorithm to compute key frames for summarization and indexing of digital videos. In the preprocessing step, we remove the video frames...
190
click to vote
DAC
2002
ACM
16 years 8 months ago
2002
ACM
Aim of this paper is to propose a methodology for the definition of an instruction-level energy estimation framework for VLIW (Very Long Instruction Word) processors. The power mo...
179
click to vote
DAC
2003
ACM
16 years 8 months ago
2003
ACM
An efficient matrix solver is critical to the analytical placement. As the size of the matrix becomes huge, the multilevel methods turn out to be more efficient and more scalable....
184
click to vote
SOSP
2009
ACM
16 years 4 months ago
2009
ACM
The UpRight library seeks to make Byzantine fault tolerance (BFT) a simple and viable alternative to crash fault tolerance for a range of cluster services. We demonstrate UpRight ...