Sciweavers

2570 search results - page 67 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
CSB
2003
IEEE
15 years 3 months ago
Fast and Accurate Probe Selection Algorithm for Large Genomes
The oligo microarray (DNA chip) technology in recent years has a significant impact on genomic study. Many fields such as gene discovery, drug discovery, toxicological research ...
Wing-Kin Sung, Wah-Heng Lee
BMCBI
2006
129views more  BMCBI 2006»
14 years 10 months ago
Fast index based algorithms and software for matching position specific scoring matrices
Background: In biological sequence analysis, position specific scoring matrices (PSSMs) are widely used to represent sequence motifs in nucleotide as well as amino acid sequences....
Michael Beckstette, Robert Homann, Robert Giegeric...
APPROX
2006
Springer
107views Algorithms» more  APPROX 2006»
15 years 1 months ago
A Fast Random Sampling Algorithm for Sparsifying Matrices
We describe a simple random-sampling based procedure for producing sparse matrix approximations. Our procedure and analysis are extremely simple: the analysis uses nothing more th...
Sanjeev Arora, Elad Hazan, Satyen Kale
CORR
2010
Springer
72views Education» more  CORR 2010»
14 years 10 months ago
Porting Decision Tree Algorithms to Multicore using FastFlow
The whole computer hardware industry embraced multicores. For these machines, the extreme optimisation of sequential algorithms is no longer sufficient to squeeze the real machine ...
Marco Aldinucci, Salvatore Ruggieri, Massimo Torqu...
TOG
2002
129views more  TOG 2002»
14 years 9 months ago
Fast bilateral filtering for the display of high-dynamic-range images
We present a new technique for the display of high-dynamic-range images, which reduces the contrast while preserving detail. It is based on a two-scale decomposition of the image ...
Frédo Durand, Julie Dorsey