182 search results - page 18 / 37 » Simple Generalized Maximum Flow Algorithms |
MOBIHOC
2007
ACM
14 years 7 months ago
2007
ACM
We consider wireless ad hoc networks with a large number of users. Subsets of users might be interested in identical information, and so we have a regime in which several multicas...
DAM
2007
13 years 7 months ago
2007
We study the problem of uniformly partitioning the edge set of a tree with n edges into k connected components, where k ≤ n. The objective is to minimize the ratio of the maximu...
SCVMA
2004
Springer
14 years 1 months ago
2004
Springer
3D-model-based tracking offers one possibility to explicate the manner in which spatial coherence can be exploited for the analysis of image sequences. Two seemingly different ap...
IPPS
1998
IEEE
14 years 22 hour ago
1998
IEEE
A deadlock-free tree-based multicast routing algorithm is presented for all direct networks, regardless of interconnection topology. The algorithm delivers a message to any number...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
Several algorithms have been proposed to learn to rank entities modeled as feature vectors, based on relevance feedback. However, these algorithms do not model network connections...