Sciweavers

2745 search results - page 230 / 549
» A fast algorithm for computing large Fibonacci numbers
Sort
View
BMVC
2010
15 years 2 months ago
Weakly Supervised Object Recognition and Localization with Invariant High Order Features
High order features have been proposed to incorporate geometrical information into the "bag of feature" representation. We propose algorithms to perform fast weakly supe...
Yimeng Zhang, Tsuhan Chen
ICPR
2004
IEEE
16 years 5 months ago
Gaussian Energy Functions for Registration without Correspondences
A new criterion based on Gaussian fields is introduced and applied to the task of automatic rigid registration of point-sets. The method defines a simple energy function, which is...
Andreas Koschan, Besma R. Abidi, Faysal Boughorbel...
WABI
2009
Springer
128views Bioinformatics» more  WABI 2009»
15 years 11 months ago
A General Framework for Local Pairwise Alignment Statistics with Gaps
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...
Pasi Rastas
IJNSEC
2008
131views more  IJNSEC 2008»
15 years 4 months ago
Performance Analysis of Soft Computing Based Anomaly Detectors
Anomaly detectors have become a necessary component of the computer and information security framework. Some of the numerous drawbacks experienced by the current Anomaly detectors...
N. Srinivasan, V. Vaidehi
VC
1998
66views more  VC 1998»
15 years 4 months ago
Vertex representations and their applications in computer graphics
The vertex representation, a new data structure for representing and manipulating orthogonal objects, is presented. Both interiors and boundaries of regions are represented implic...
Claudio Esperança, Hanan Samet