Zobrazeno 1 - 10
of 47
pro vyhledávání: '"Yedidia, Jonathan S."'
We address the problem of planning collision-free paths for multiple agents using optimization methods known as proximal algorithms. Recently this approach was explored in Bento et al. 2013, which demonstrated its ease of parallelization and decentra
Externí odkaz:
http://arxiv.org/abs/1504.01783
In this paper we consider optimization as an approach for quickly and flexibly developing hybrid cognitive capabilities that are efficient, scalable, and can exploit knowledge to improve solution speed and quality. In this context, we focus on the Th
Externí odkaz:
http://arxiv.org/abs/1311.4064
We describe how the powerful "Divide and Concur" algorithm for constraint satisfaction can be derived as a special case of a message-passing version of the Alternating Direction Method of Multipliers (ADMM) algorithm for convex optimization, and intr
Externí odkaz:
http://arxiv.org/abs/1305.1961
We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation. Our methodology starts by defining a new class of "hierarchical" quasi-cyclic (HQC) LDPC co
Externí odkaz:
http://arxiv.org/abs/1111.0711
The "Divide and Concur'' (DC) algorithm, recently introduced by Gravel and Elser, can be considered a competitor to the belief propagation (BP) algorithm, in that both algorithms can be applied to a wide variety of constraint satisfaction, optimizati
Externí odkaz:
http://arxiv.org/abs/1001.1730
Cooperation between the nodes of wireless multihop networks can increase communication reliability, reduce energy consumption, and decrease latency. The possible improvements are even greater when nodes perform mutual information accumulation using r
Externí odkaz:
http://arxiv.org/abs/0908.3886
Autor:
Martinian, Emin, Yedidia, Jonathan S.
Publikováno v:
Proceedings of the 41st Annual Allerton Conference on Communication, Control, and Computing; Monticello, IL; 2004
We study codes on graphs combined with an iterative message passing algorithm for quantization. Specifically, we consider the binary erasure quantization (BEQ) problem which is the dual of the binary erasure channel (BEC) coding problem. We show that
Externí odkaz:
http://arxiv.org/abs/cs/0408008
Publikováno v:
In Biologically Inspired Cognitive Architectures April 2014 8:109-119
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.