Sciweavers

2570 search results - page 310 / 514
» Fast Algorithms For The Computation Of Ranklets
Sort
View
131
Voted
CMSB
2006
Springer
15 years 7 months ago
Possibilistic Approach to Biclustering: An Application to Oligonucleotide Microarray Data Analysis
Abstract. The important research objective of identifying genes with similar behavior with respect to different conditions has recently been tackled with biclustering techniques. I...
Maurizio Filippone, Francesco Masulli, Stefano Rov...
121
Voted
TVCG
2008
128views more  TVCG 2008»
15 years 3 months ago
AD-Frustum: Adaptive Frustum Tracing for Interactive Sound Propagation
We present an interactive algorithm to compute sound propagation paths for transmission, specular reflection and edge diffraction in complex scenes. Our formulation uses an adaptiv...
Anish Chandak, Christian Lauterbach, Micah T. Tayl...
198
Voted
STOC
1997
ACM
257views Algorithms» more  STOC 1997»
15 years 7 months ago
Practical Loss-Resilient Codes
We present randomized constructions of linear-time encodable and decodable codes that can transmit over lossy channels at rates extremely close to capacity. The encoding and decod...
Michael Luby, Michael Mitzenmacher, Mohammad Amin ...
133
Voted
ICIP
2006
IEEE
16 years 5 months ago
An Efficient Method for the Removal of Impulse Noise
A computationally efficient algorithm is proposed to remove noise impulses from speech and audio signals while retaining its features and tonal quality. The proposed method is bas...
Wenbin Luo, Dung Dang
112
Voted
CISIS
2008
IEEE
15 years 10 months ago
Single-Pass List Partitioning
Parallel algorithms divide computation among several threads. In many cases, the input must also be divided. Consider an input consisting of a linear sequence of elements whose le...
Leonor Frias, Johannes Singler, Peter Sanders