6365 search results - page 14 / 1273 » Fast Local Computation Algorithms |
121
Voted
WABI
2009
Springer
15 years 9 months ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
126
Voted
BMVC
2010
15 years 12 days ago
2010
High order features have been proposed to incorporate geometrical information into the "bag of feature" representation. We propose algorithms to perform fast weakly supe...
118
click to vote
ICRA
2009
IEEE
15 years 9 months ago
2009
IEEE
— In our recent work [1], [2], we proposed Point Feature Histograms (PFH) as robust multi-dimensional features which describe the local geometry around a point p for 3D point clo...
115
click to vote
ICRA
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, we describe a novel self-localizationalgorithm. Self-Localizationmethods are required for to lowercomputational costand handling vague sensordata. Thus, we propose ...
129
Voted
ICPR
2006
IEEE
16 years 3 months ago
2006
IEEE
This paper presents a novel algorithm for unsupervised texture segmentation. The proposed algorithm incorporates the Local Binary Pattern operator under a segmentation framework b...