Sciweavers

1480 search results - page 119 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
ICASSP
2009
IEEE
14 years 2 months ago
Principal component analysis in decomposable Gaussian graphical models
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. ...
Ami Wiesel, Alfred O. Hero III
ICCI
1991
14 years 2 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
CIKM
2008
Springer
14 years 23 days ago
Identifying table boundaries in digital documents via sparse line detection
Most prior work on information extraction has focused on extracting information from text in digital documents. However, often, the most important information being reported in an...
Ying Liu, Prasenjit Mitra, C. Lee Giles
TWC
2008
135views more  TWC 2008»
13 years 10 months ago
Optimal Distributed Stochastic Routing Algorithms for Wireless Multihop Networks
A novel framework was introduced recently for stochastic routing in wireless multihop networks, whereby each node selects a neighbor to forward a packet according to a probability...
Alejandro Ribeiro, Nikolas D. Sidiropoulos, Georgi...
SIAMIS
2011
13 years 5 months ago
Large Scale Bayesian Inference and Experimental Design for Sparse Linear Models
Abstract. Many problems of low-level computer vision and image processing, such as denoising, deconvolution, tomographic reconstruction or superresolution, can be addressed by maxi...
Matthias W. Seeger, Hannes Nickisch