209 search results - page 32 / 42 » Computing a Diameter-Constrained Minimum Spanning Tree in Pa... |
IPPS
2009
IEEE
15 years 4 months ago
2009
IEEE
We consider the operator mapping problem for in-network stream processing, i.e., the application of a tree of operators in steady-state to multiple data objects that are continuou...
107
click to vote
PAMI
2010
14 years 7 months ago
2010
—We propose a combinatorial solution to determine the optimal elastic matching of a deformable template to an image. The central idea is to cast the optimal matching of each temp...
IWPEC
2009
Springer
15 years 4 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
DC
2010
14 years 9 months ago
2010
Consider a distributed system N in which each agent has an input value and each communication link has a weight. Given a global function, that is, a function f whose value depends...
IPPS
2003
IEEE
15 years 2 months ago
2003
IEEE
Given a vector ( 1 2 ::: t) of non increasing positive integers, and an undirected graph G = (V E), an L( 1 2 ::: t)-coloring of G is a function f from the vertex set V to a set o...