Sciweavers

4536 search results - page 149 / 908
» Contention-Sensitive Data Structures and Algorithms
Sort
View
BMCBI
2006
161views more  BMCBI 2006»
13 years 9 months ago
A method for rapid similarity analysis of RNA secondary structures
Background: Owing to the rapid expansion of RNA structure databases in recent years, efficient methods for structure comparison are in demand for function prediction and evolution...
Na Liu, Tianming Wang
BMCBI
2006
120views more  BMCBI 2006»
13 years 9 months ago
Projections for fast protein structure retrieval
Background: In recent times, there has been an exponential rise in the number of protein structures in databases e.g. PDB. So, design of fast algorithms capable of querying such d...
Sourangshu Bhattacharya, Chiranjib Bhattacharyya, ...
TIP
2010
155views more  TIP 2010»
13 years 7 months ago
Laplacian Regularized D-Optimal Design for Active Learning and Its Application to Image Retrieval
—In increasingly many cases of interest in computer vision and pattern recognition, one is often confronted with the situation where data size is very large. Usually, the labels ...
Xiaofei He
JMIV
2007
158views more  JMIV 2007»
13 years 9 months ago
On the Consistency of the Normalized Eight-Point Algorithm
A recently proposed argument to explain the improved performance of the eight-point algorithm that results from using normalized data [IEEE Trans. Pattern Anal. Mach. Intell., 25(9...
Wojciech Chojnacki, Michael J. Brooks
ACIVS
2006
Springer
14 years 3 months ago
A Comparison of Nearest Neighbor Search Algorithms for Generic Object Recognition
The nearest neighbor (NN) classifier is well suited for generic object recognition. However, it requires storing the complete training data, and classification time is linear in ...
Ferid Bajramovic, Frank Mattern, Nicholas Butko, J...