199 search results - page 19 / 40 » Fast Algorithms for Computing Tree LCS |
194
click to vote
NIPS
2008
15 years 3 months ago
2008
Many machine learning algorithms require the summation of Gaussian kernel functions, an expensive operation if implemented straightforwardly. Several methods have been proposed to...
KDD
2000
ACM
15 years 6 months ago
2000
ACM
Affordable, fast computers with large memories have lessened the demand for program efficiency, but applications such as browsing and searching very large databases often have rat...
128
Voted
IPPS
2005
IEEE
15 years 8 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
107
click to vote
IPPS
2003
IEEE
15 years 7 months ago
2003
IEEE
Inference of phylogenetic trees comprising hundreds or even thousands of organisms based on the maximum likelihood method is computationally extremely expensive. In previous work,...
106
Voted
DCC
2000
IEEE
15 years 6 months ago
2000
IEEE
We introduce a new image compression algorithm that allows progressive image reconstruction – both in resolution and in fidelity, with a fully embedded bitstream. The algorithm ...