6105 search results - page 1190 / 1221 » A Parallel Algorithm for Bound-Smoothing |
COLING
1992
13 years 9 months ago
1992
This paper proposes a two-phase example-based machine translation methodology which develops translation templates from examples and then translates using template matching. This ...
SIGMOD
2010
ACM
13 years 8 months ago
2010
ACM
Discriminative subgraphs are widely used to define the feature space for graph classification in large graph databases. Several scalable approaches have been proposed to mine disc...
BMCBI
2008
13 years 8 months ago
2008
Background: In many research areas it is necessary to find differences between treatment groups with several variables. For example, studies of microarray data seek to find a sign...
BMCBI
2008
13 years 8 months ago
2008
Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
CORR
2010
Springer
13 years 8 months ago
2010
Springer
Sphere decoding achieves maximum-likelihood (ML) performance at the cost of exponential complexity; lattice reduction-aided successive interference cancelation (SIC) significantly...