3192 search results - page 187 / 639 » The minimum latency problem |
191
click to vote
APPROX
2000
Springer
15 years 8 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
147
click to vote
CPM
2000
Springer
15 years 8 months ago
2000
Springer
We study Hamming versions of two classical clustering problems. The Hamming radius p-clustering problem (HRC) for a set S of k binary strings, each of length n, is to find p bina...
150
click to vote
SIAMDM
2010
14 years 11 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
144
click to vote
MM
2006
ACM
15 years 10 months ago
2006
ACM
We introduce the challenge problem for generic video indexing to gain insight in intermediate steps that affect performance of multimedia analysis methods, while at the same time...
169
click to vote
SIAMSC
2008
15 years 4 months ago
2008
Abstract. We present a multigrid algorithm for the solution of distributed parameter inverse problems constrained by variable-coefficient linear parabolic partial differential equa...