400 search results - page 19 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
CORR
2011
Springer
14 years 1 months ago
2011
Springer
We propose Shotgun, a parallel coordinate descent algorithm for minimizing L1regularized losses. Though coordinate descent seems inherently sequential, we prove convergence bounds...
HPCC
2005
Springer
15 years 3 months ago
2005
Springer
With the multicast technology, demands for the real-time group applications through multicasting is getting more important. An essential factor of these real-time strategy is to op...
CCECE
2006
IEEE
15 years 3 months ago
2006
IEEE
Phylogenetic trees are commonly reconstructed based on hard optimization problems such as Maximum parsimony (MP) and Maximum likelihood (ML). Conventional MP heuristics for produc...
SPDP
1991
IEEE
15 years 1 months ago
1991
IEEE
In this paper, we present a randomized algorithm for the multipacket (i.e., k − k) routing problem on an n × n mesh. The algorithm completes with high probability in at the mos...
ICPP
1995
IEEE
15 years 1 months ago
1995
IEEE
If G is a connected graph with N nodes, its r dimensional product contains Nr nodes. We present an algorithm which sorts Nr keys stored in the rdimensional product of any graph G ...