Sciweavers

1578 search results - page 280 / 316
» Direct Routing: Algorithms and Complexity
Sort
View
CDC
2010
IEEE
147views Control Systems» more  CDC 2010»
13 years 4 months ago
Asymmetric information diffusion via gossiping on static and dynamic networks
In this paper we consider the problem of gossiping in a network to diffuse the average of a sub-set of nodes, called sources, and directing it to another sub-set of nodes in the ne...
Mehmet Ercan Yildiz, Anna Scaglione, Asuman E. Ozd...
TCOM
2010
83views more  TCOM 2010»
13 years 4 months ago
Early-Elimination Modification for Priority-First Search Decoding
Abstract--In order to release the growing demand for computational complexity with respect to increasing information sequence length in the priority-first search decoding algorithm...
Shin-Lin Shieh, Po-Ning Chen, Yunghsiang S. Han, T...
CORR
2011
Springer
190views Education» more  CORR 2011»
13 years 1 months ago
Doubly Robust Smoothing of Dynamical Processes via Outlier Sparsity Constraints
Abstract—Coping with outliers contaminating dynamical processes is of major importance in various applications because mismatches from nominal models are not uncommon in practice...
Shahrokh Farahmand, Georgios B. Giannakis, Daniele...
SIAMREV
2011
63views more  SIAMREV 2011»
13 years 21 days ago
Discrete Symbol Calculus
This paper deals with efficient numerical representation and manipulation of differential and integral operators as symbols in phase-space, i.e., functions of space x and frequen...
Laurent Demanet, Lexing Ying
CORR
2012
Springer
214views Education» more  CORR 2012»
12 years 5 months ago
Sum-Product Networks: A New Deep Architecture
The key limiting factor in graphical model inference and learning is the complexity of the partition function. We thus ask the question: what are the most general conditions under...
Hoifung Poon, Pedro Domingos