730 search results - page 20 / 146 » Faster dimension reduction |
ACL
2009
13 years 6 months ago
2009
We investigate the use of Fisher's exact significance test for pruning the translation table of a hierarchical phrase-based statistical machine translation system. In additio...
CDC
2009
IEEE
14 years 1 months ago
2009
IEEE
A dimension reduction method called Discrete Empirical Interpolation (DEIM) is proposed and shown to dramatically reduce the computational complexity of the popular Proper Orthogo...
OOPSLA
2009
Springer
14 years 3 months ago
2009
Springer
Generic classes can be used to improve performance by allowing compile-time polymorphism. But the applicability of compile-time polymorphism is narrower than that of runtime polym...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
The measure and conquer approach has proven to be a powerful tool to analyse exact algorithms for combinatorial problems, like Dominating Set and Independent Set. In this paper, we...
COCOON
2005
Springer
13 years 10 months ago
2005
Springer
The Maximum Common Subgraph (MCS) problem appears in many guises and in a wide variety of applications. The usual goal is to take as inputs two graphs, of order m and n, respectiv...