1236 search results - page 27 / 248 » fast 2010 |
109
Voted
SIAMSC
2010
14 years 4 months ago
2010
The fast Gauss transform allows for the calculation of the sum of N Gaussians at M points in O(N + M) time. Here, we extend the algorithm to a wider class of kernels, motivated by ...
93
Voted
WEA
2010
Springer
15 years 4 months ago
2010
Springer
We improve on earlier FPT algorithms for computing a rooted maximum agreement forest (MAF) or a maximum acyclic agreement forest (MAAF) of a pair of phylogenetic trees. Their sizes...
ICPR
2010
IEEE
15 years 23 days ago
2010
IEEE
A non-iterative method of image super-resolution based on weighted median filtering with Gaussian weights is proposed. Visual tests and basic edges metrics were used to examine th...
64
Voted
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
Maximum a posteriori (MAP) inference in graphical models requires that we maximize the sum of two terms: a data-dependent term, encoding the conditional likelihood of a certain la...
104
click to vote
FOCS
2010
IEEE
14 years 7 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...