1480 search results - page 121 / 296 » Distributed algorithms for weighted problems in sparse graph... |
NECO
2010
13 years 9 months ago
2010
Reinforcement learning models generally assume that a stimulus is presented that allows a learner to unambiguously identify the state of nature, and the reward received is drawn f...
APPROX
2010
Springer
14 years 10 days ago
2010
Springer
We consider the question: What is the maximum flow achievable in a network if the flow must be decomposable into a collection of edgedisjoint paths? Equivalently, we wish to find a...
KDD
2008
ACM
14 years 11 months ago
2008
ACM
Low-rank approximations of the adjacency matrix of a graph are essential in finding patterns (such as communities) and detecting anomalies. Additionally, it is desirable to track ...
CVPR
2007
IEEE
15 years 24 days ago
2007
IEEE
This paper proposes a novel method to apply the standard graph cut technique to segmenting multimodal tensor valued images. The Riemannian nature of the tensor space is explicitly...
PKDD
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. We propose a new graph-based label propagation algorithm for transductive learning. Each example is associated with a vertex in an undirected graph and a weighted edge be...