269 search results - page 20 / 54 » Computing the inverse sort transform in linear time |
148
click to vote
CCCG
2008
15 years 5 months ago
2008
A problem arising in statistical data analysis and pattern recognition is to find a longest interval free of data points, given a set of data points in the unit interval. We use t...
156
click to vote
CORR
2008
Springer
15 years 4 months ago
2008
Springer
Abstract--Interior-point methods are state-of-the-art algorithms for solving linear programming (LP) problems with polynomial complexity. Specifically, the Karmarkar algorithm typi...
175
click to vote
ESANN
2004
15 years 5 months ago
2004
We propose an algorithm for recovering the matrix A in X = AS where X is a random vector of lower dimension than S. S is assumed to be sparse in the sense that S has less nonzero e...
142
click to vote
COLING
2010
14 years 11 months ago
2010
In statistical machine translation, decoding without any reordering constraint is an NP-hard problem. Inversion Transduction Grammars (ITGs) exploit linguistic structure and can w...
166
click to vote
ASPLOS
1996
ACM
15 years 8 months ago
1996
ACM
On a distributed memory machine, hand-coded message passing leads to the most efficient execution, but it is difficult to use. Parallelizing compilers can approach the performance...