6105 search results - page 969 / 1221 » A Parallel Algorithm for Bound-Smoothing |
166
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: Many analyses of microarray association studies involve permutation, bootstrap resampling and crossvalidation, that are ideally formulated as embarrassingly parallel c...
225
click to vote
CVPR
2009
IEEE
17 years 1 months ago
2009
IEEE
We propose a new bilateral filtering algorithm with computational
complexity invariant to filter kernel size, socalled
O(1) or constant time in the literature. By showing
that a...
151
click to vote
CVPR
2007
IEEE
16 years 8 months ago
2007
IEEE
Accurately identifying corresponded landmarks from a population of shape instances is the major challenge in constructing statistical shape models. In this paper, we address this ...
206
click to vote
BIBE
2008
IEEE
16 years 1 months ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
230
click to vote
ICANNGA
2007
Springer
16 years 23 days ago
2007
Springer
In this paper we present a new method of 3D non-negative tensor factorization (NTF) that is robust in the presence of noise and has many potential applications, including multi-way...