1074 search results - page 149 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
IWOCA
2010
Springer
14 years 4 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...
ICASSP
2011
IEEE
14 years 1 months ago
2011
IEEE
Quantization is intrinsic to several data acquisition systems. This process is especially important in distributed settings, where observations must rst be compressed before they ...
79
Voted
Publication
In this paper we describe a new class of representations for realvalued parameters called Center of Mass Encoding (CoME). CoME is based on variable length strings, it is self-adap...
113
click to vote
JMLR
2012
13 years 6 days ago
2012
Contextual bandit learning is a reinforcement learning problem where the learner repeatedly receives a set of features (context), takes an action and receives a reward based on th...
PPOPP
2009
ACM
15 years 10 months ago
2009
ACM
Load balancing is a technique which allows efficient parallelization of irregular workloads, and a key component of many applications and parallelizing runtimes. Work-stealing is ...