1830 search results - page 175 / 366 » Workshop on Graph Computation Models |
157
Voted
JMLR
2010
14 years 12 months ago
2010
It is probably fair to say that exact inference in graphical models is considered a solved problem, at least regarding its computational complexity: it is exponential in the treew...
178
Voted
PODC
2011
ACM
14 years 7 months ago
2011
ACM
We study several variants of coordinated consensus in dynamic networks. We assume a synchronous model, where the communication graph for each round is chosen by a worst-case adver...
158
click to vote
COMPLEX
2009
Springer
15 years 9 months ago
2009
Springer
Creating ensembles of random but "realistic" topologies for complex systems is crucial for many tasks such as benchmark generation and algorithm analysis. In general, exp...
153
click to vote
MIRAGE
2007
Springer
15 years 11 months ago
2007
Springer
Abstract. This paper introduces a new concept within shadow segmentation for usage in shadow removal and augmentation through construction of an alpha overlay shadow model. Previou...
128
Voted
ICASSP
2009
IEEE
15 years 9 months ago
2009
IEEE
We consider principal component analysis (PCA) in decomposable Gaussian graphical models. We exploit the prior information in these models in order to distribute its computation. ...