Sciweavers

1480 search results - page 50 / 296
» Distributed algorithms for weighted problems in sparse graph...
Sort
View
CORR
2008
Springer
108views Education» more  CORR 2008»
13 years 7 months ago
Rate and power allocation under the pairwise distributed source coding constraint
We explore the problem of rate and power allocation for a sensor network where pairwise distributed source coding is employed (introduced by Roumy and Gesbert `07). For noiseless n...
Shizheng Li, Aditya Ramamoorthy
IPPS
2007
IEEE
14 years 1 months ago
Analyzing the Scalability of Graph Algorithms on Eldorado
The Cray MTA-2 system provides exceptional performance on a variety of sparse graph algorithms. Unfortunately, it was an extremely expensive platform. Cray is preparing an Eldorad...
Keith D. Underwood, Megan Vance, Jonathan W. Berry...
ICCV
2007
IEEE
14 years 9 months ago
Joint Affinity Propagation for Multiple View Segmentation
A joint segmentation is a simultaneous segmentation of registered 2D images and 3D points reconstructed from the multiple view images. It is fundamental in structuring the data fo...
Jianxiong Xiao, Jingdong Wang, Ping Tan, Long Quan
SOFSEM
2007
Springer
14 years 1 months ago
Exact Max 2-Sat: Easier and Faster
Prior algorithms known for exactly solving Max 2-Sat improve upon the trivial upper bound only for very sparse instances. We present new algorithms for exactly solving (in fact, c...
Martin Fürer, Shiva Prasad Kasiviswanathan
SODA
2008
ACM
84views Algorithms» more  SODA 2008»
13 years 9 months ago
Robust cost colorings
We consider graph coloring problems where the cost of a coloring is the sum of the costs of the colors, and the cost of a color is a monotone concave function of the total weight ...
Takuro Fukunaga, Magnús M. Halldórss...