1612 search results - page 199 / 323 » Analysing Randomized Distributed Algorithms |
161
click to vote
SIGMOD
2011
ACM
14 years 5 months ago
2011
ACM
Joins are essential for many data analysis tasks, but are not supported directly by the MapReduce paradigm. While there has been progress on equi-joins, implementation of join alg...
148
click to vote
HIPC
2007
Springer
15 years 6 months ago
2007
Springer
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
UAI
2004
15 years 3 months ago
2004
Ancestral graph models, introduced by Richardson and Spirtes (2002), generalize both Markov random fields and Bayesian networks to a class of graphs with a global Markov property ...
101
click to vote
ADMA
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Most of the work in Machine Learning assume that examples are generated at random according to some stationary probability distribution. In this work we study the problem...
146
click to vote
DEDS
2010
14 years 12 months ago
2010
We consider Discrete Event Systems (DES) involving tasks with real-time constraints and seek to control processing times so as to minimize a cost function subject to each task mee...