6105 search results - page 288 / 1221 » A Parallel Algorithm for Bound-Smoothing |
195
Voted
AINA
2004
IEEE
15 years 10 months ago
2004
IEEE
Efficient computing the PageRank scores for a large web graph is actually one of the hot issues in Web-IR community. Recent researches propose to accelerate the computation, both ...
161
click to vote
AAAI
2010
15 years 8 months ago
2010
The depth first proof number search (df-pn) is an effective and popular algorithm for solving and-or tree problems by using proof and disproof numbers. This paper presents a simpl...
176
click to vote
PPSC
1997
15 years 8 months ago
1997
A parallel method for dynamic partitioning of unstructured meshes is described. The method employs a new iterative optimisation technique which both balances the workload and atte...
160
click to vote
CORR
2011
Springer
14 years 10 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...
160
click to vote
AIRS
2004
Springer
16 years 2 days ago
2004
Springer
There exist practical bit-parallel algorithms for several types of pair-wise string processing, such as longest common subsequence computation or approximate string matching. The b...