1952 search results - page 273 / 391 » Complete partitions of graphs |
193
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
In this study, we consider an environment composed of a heterogeneous cluster of multicore-based machines used to analyze satellite images. The workload involves large data sets, a...
189
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
Efficiently querying RDF [1] data is being an important factor in applying Semantic Web technologies to real-world applications. In this context, many efforts have been made to st...
173
click to vote
CGO
2006
IEEE
16 years 14 days ago
2006
IEEE
Most programs are repetitive, where similar behavior can be seen at different execution times. Algorithms have been proposed that automatically group similar portions of a program...
153
click to vote
COMPGEOM
2004
ACM
15 years 12 months ago
2004
ACM
Triangle strips have been widely used for efficient rendering. It is NP-complete to test whether a given triangulated model can be represented as a single triangle strip, so many...
198
click to vote
SWAT
2010
Springer
15 years 11 months ago
2010
Springer
Given a permutation π of {1, . . . , n} and a positive integer k, we give an algorithm with running time 2O(k2 log k) nO(1) that decides whether π can be partitioned into at mos...