328 search results - page 65 / 66 » Homomorphism bounded classes of graphs |
STACS
2007
Springer
14 years 1 months ago
2007
Springer
A coloring of a graph is convex if it induces a partition of the vertices into connected subgraphs. Besides being an interesting property from a theoretical point of view, tests f...
ICPADS
1994
IEEE
13 years 11 months ago
1994
IEEE
Testingthe performance scalabilityof parallelprograms can be a time consuming task, involving many performance runs for different computer configurations, processor numbers, and p...
CVPR
2010
IEEE
13 years 9 months ago
2010
IEEE
Abstract. This work addresses a class of total-variation based multilabeling problems over a spatially continuous image domain, where the data fidelity term can be any bounded fun...
SIGMETRICS
2008
ACM
13 years 7 months ago
2008
ACM
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
CRYPTO
2007
Springer
14 years 1 months ago
2007
Springer
A public random function is a random function that is accessible by all parties, including the adversary. For example, a (public) random oracle is a public random function {0, 1}...