Sciweavers

2570 search results - page 151 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
122
Voted
ICCV
2007
IEEE
16 years 5 months ago
Fast Bilinear SfM with Side Information
We study the beneficial effect of side information on the Structure from Motion (SfM) estimation problem. The side information that we consider is measurement of a `reference vect...
Mahesh Ramachandran, Ashok Veeraraghavan, Rama Che...
ICIP
2004
IEEE
16 years 5 months ago
Fast in-band motion estimation with variable size block matching
In this paper we propose a fast motion estimation technique that works in the wavelet domain. The computational cost of the algorithm turns out to be proportional to the linear si...
Davide Maestroni, Augusto Sarti, Marco Tagliasacch...
153
Voted
RECOMB
2008
Springer
16 years 3 months ago
A Fast, Alignment-Free, Conservation-Based Method for Transcription Factor Binding Site Discovery
As an increasing number of eukaryotic genomes are being sequenced, comparative studies aimed at detecting regulatory elements in intergenic sequences are becoming more prevalent. M...
Raluca Gordân, Leelavati Narlikar, Alexander...
ICAC
2006
IEEE
15 years 9 months ago
Fast and Effective Worm Fingerprinting via Machine Learning
— As Internet worms become ever faster and more sophisticated, it is important to be able to extract worm signatures in an accurate and timely manner. In this paper, we apply mac...
Stewart M. Yang, Jianping Song, Harish Rajamani, T...
119
Voted
ANCS
2006
ACM
15 years 9 months ago
A practical fast parallel routing architecture for Clos networks
Clos networks are an important class of switching networks due to their modular structure and much lower cost compared with crossbars. For routing I/O permutations of Clos network...
Si-Qing Zheng, Ashwin Gumaste, Enyue Lu