1778 search results - page 207 / 356 » On the Power of the Randomized Iterate |
170
click to vote
IPCO
2010
15 years 7 months ago
2010
Abstract. We consider two-person zero-sum stochastic mean payoff games with perfect information, or BWR-games, given by a digraph G = (V = VB VW VR, E), with local rewards r : E R...
171
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The unsplittable flow problem is one of the most extensively studied optimization problems in the field of networking. An instance of it consists of an edge capacitated graph and ...
209
click to vote
KDD
2012
ACM
13 years 8 months ago
2012
ACM
We study a novel clustering problem in which the pairwise relations between objects are categorical. This problem can be viewed as clustering the vertices of a graph whose edges a...
155
click to vote
WWW
2005
ACM
16 years 7 months ago
2005
ACM
PageRank is defined as the stationary state of a Markov chain. The chain is obtained by perturbing the transition matrix induced by a web graph with a damping factor that spreads...
181
click to vote
ALT
2009
Springer
16 years 3 months ago
2009
Springer
Abstract. Learning from streams is a process in which a group of learners separately obtain information about the target to be learned, but they can communicate with each other in ...