Sciweavers

6365 search results - page 453 / 1273
» Fast Local Computation Algorithms
Sort
View
SIGMOD
1997
ACM
127views Database» more  SIGMOD 1997»
15 years 11 months ago
Fast Parallel Similarity Search in Multimedia Databases
Most similarity search techniques map the data objects into some high-dimensional feature space. The similarity search then corresponds to a nearest-neighbor search in the feature...
Stefan Berchtold, Christian Böhm, Bernhard Br...
BMCBI
2010
205views more  BMCBI 2010»
15 years 7 months ago
A fast indexing approach for protein structure comparison
Background: Protein structure comparison is a fundamental task in structural biology. While the number of known protein structures has grown rapidly over the last decade, searchin...
Lei Zhang, James Bailey, Arun Siddharth Konagurthu...
BMCBI
2010
134views more  BMCBI 2010»
15 years 7 months ago
R-Gada: a fast and flexible pipeline for copy number analysis in association studies
Background: Genome-wide association studies (GWAS) using Copy Number Variation (CNV) are becoming a central focus of genetic research. CNVs have successfully provided target genom...
Roger Pique-Regi, Alejandro Cáceres, Juan R...
JCM
2007
140views more  JCM 2007»
15 years 7 months ago
A Dynamic Scheduling Algorithm for Divisible Loads in Grid Environments
—Divisible loads are those workloads that can be partitioned by a scheduler into any arbitrary chunks. The problem of scheduling divisible loads has been defined for a long time,...
Nguyen The Loc, Said Elnaffar
ACSC
2004
IEEE
15 years 11 months ago
On Improving the Memory Access Patterns During The Execution of Strassen's Matrix Multiplication Algorithm
Matrix multiplication is a basic computing operation. Whereas it is basic, it is also very expensive with a straight forward technique of O(N3 ) runtime complexity. More complex s...
Hossam A. ElGindy, George Ferizis