7015 search results - page 230 / 1403 » Approximation algorithms for co-clustering |
163
click to vote
EACL
2009
ACL Anthology
16 years 7 months ago
2009
ACL Anthology
We introduce cube summing, a technique that permits dynamic programming algorithms for summing over structures (like the forward and inside algorithms) to be extended with non-loc...
158
click to vote
SOFSEM
2009
Springer
16 years 3 months ago
2009
Springer
During the last years, speed-up techniques for DIJKSTRA’s algorithm have been developed that make the computation of shortest paths a matter of microseconds even on huge road net...
163
click to vote
AAIM
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In an implicit combinatorial optimization problem, the constraints are not enumerated explicitly but rather stated implicitly through equations, other constraints or auxi...
160
click to vote
ICASSP
2008
IEEE
16 years 29 days ago
2008
IEEE
In this paper, we extend the cross-multiplicative transfer function (CMTF) approach for improved system identification in the shorttime Fourier transform (STFT) domain. The propo...
173
click to vote
WSC
2008
15 years 8 months ago
2008
Approximate dynamic programming is emerging as a powerful tool for certain classes of multistage stochastic, dynamic problems that arise in operations research. It has been applie...