2314 search results - page 312 / 463 » Minimal Partitions of a Graph |
150
Voted
WWW
2008
ACM
16 years 4 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...
135
Voted
CGO
2006
IEEE
15 years 10 months 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...
122
click to vote
COMPGEOM
2004
ACM
15 years 9 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...
163
click to vote
SWAT
2010
Springer
15 years 9 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...
169
click to vote
TDSC
2010
15 years 2 months ago
2010
—Secret sharing and erasure coding-based approaches have been used in distributed storage systems to ensure the confidentiality, integrity, and availability of critical informati...