6045 search results - page 39 / 1209 » Computable Linearizations of Well-partial-orderings |
155
click to vote
PPOPP
2012
ACM
14 years 1 months ago
2012
ACM
The efforts of an expert to parallelize and optimize a dense linear algebra algorithm for distributed-memory targets are largely mechanical and repetitive. We demonstrate that the...
164
click to vote
ACL
2012
13 years 8 months ago
2012
We propose a novel heuristic algorithm for Cube Pruning running in linear time in the beam size. Empirically, we show a gain in running time of a standard machine translation syst...
150
click to vote
ICPR
2010
IEEE
15 years 10 months ago
2010
IEEE
We propose a new circularity measure inspired from Arkin [1], Latecki [9] tools of shape matching that is constructed in a tangent space. We then introduce a linear algorithm that...
144
click to vote
DCC
2002
IEEE
15 years 6 months ago
2002
IEEE
Asymptotically bounding the covering radius in terms of the dual distance is a well-studied problem. We will combine the polynomial approach with estimates of the distance distribu...
154
click to vote
TCS
2011
15 years 1 months ago
2011
The general Bandpass problem is NP-hard and was claimed NP-hard when the number of columns is three. Previously we designed a polynomial time row-stacking algorithm for the three ...