Sciweavers

5183 search results - page 453 / 1037
» The Complexity of Distributions
Sort
View
198
Voted
IPPS
2009
IEEE
16 years 1 months ago
Compact graph representations and parallel connectivity algorithms for massive dynamic network analysis
Graph-theoretic abstractions are extensively used to analyze massive data sets. Temporal data streams from socioeconomic interactions, social networking web sites, communication t...
Kamesh Madduri, David A. Bader
ICDCS
2005
IEEE
16 years 14 days ago
Comparison of Approaches to Service Deployment
IT today is driven by the trend of increasing scale and complexity. Utility and Grid computing models, PlanetLab, and traditional data centers, are reaching the scale of thousands...
Vanish Talwar, Qinyi Wu, Calton Pu, Wenchang Yan, ...
ICGI
2010
Springer
15 years 5 months ago
Learning PDFA with Asynchronous Transitions
In this paper we extend the PAC learning algorithm due to Clark and Thollard for learning distributions generated by PDFA to automata whose transitions may take varying time length...
Borja Balle, Jorge Castro, Ricard Gavaldà
186
Voted
CORR
2008
Springer
129views Education» more  CORR 2008»
15 years 7 months ago
Hierarchical Bayesian sparse image reconstruction with application to MRFM
This paper presents a hierarchical Bayesian model to reconstruct sparse images when the observations are obtained from linear transformations and corrupted by an additive white Gau...
Nicolas Dobigeon, Alfred O. Hero, Jean-Yves Tourne...
309
Voted
INFOCOM
2011
IEEE
14 years 10 months ago
Optimizing network-coded cooperative communications via joint session grouping and relay node selection
Abstract—Network-coded cooperative communications (NCCC) is a new paradigm in wireless networks that employs network coding (NC) to improve the performance of CC. The core mechan...
Sushant Sharma, Yi Shi, Y. Thomas Hou, Hanif D. Sh...