1963 search results - page 119 / 393 » The Maximum Solution Problem on Graphs |
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
In this paper, we study parallel I/O efficient graph algorithms in the Parallel External Memory (PEM) model, one of the private-cache chip multiprocessor (CMP) models. We study the...
ICIAR
2004
Springer
14 years 3 months ago
2004
Springer
We present a maximum a posteriori solution to problems of accurate registration of blurred images and recovery of an original undegraded image. Our algorithm has the advantage that...
PRL
2006
13 years 10 months ago
2006
We present a maximum a posteriori solution to the problem of obtaining a high-resolution image from a set of degraded low-resolution images of the same scene. The proposed algorit...
STOC
2003
ACM
14 years 10 months ago
2003
ACM
We present a new bicriteria approximation algorithm for the degree-bounded minimum-cost spanning tree problem: Given an undirected graph with nonnegative edge weights and degree b...
TAMC
2010
Springer
14 years 3 months ago
2010
Springer
Incrementally k-list coloring a graph means that a graph is given by adding stepwise one vertex after another, and for each intermediate step we ask for a vertex coloring such that...