2814 search results - page 318 / 563 » Competitive Analysis of Distributed Algorithms |
COLT
2006
Springer
15 years 4 months ago
2006
Springer
We study functions with multiple output values, and use active sampling to identify an example for each of the possible output values. Our results for this setting include: (1) Eff...
102
Voted
NIPS
2008
15 years 1 months ago
2008
Many machine learning algorithms can be formulated in the framework of statistical independence such as the Hilbert Schmidt Independence Criterion. In this paper, we extend this c...
SODA
2003
ACM
15 years 1 months ago
2003
ACM
We consider the problem of uniformly sampling a vertex of a transportation polytope with m sources and n destinations, where m is a constant. We analyse a natural random walk on t...
82
Voted
IOR
2010
14 years 11 months ago
2010
We present exchange formulas that allow to express the stationary distribution of a continuous Markov chain with denumerable state-space having generator matrix Q∗ through a con...
103
click to vote
PPDP
2001
Springer
15 years 4 months ago
2001
Springer
We introduce a new system of trust analysis for concurrent and distributed systems using the π-calculus[13, 14, 15] as a modelling tool. A Type system using boolean annotations g...