5096 search results - page 842 / 1020 » Landscape of Clustering Algorithms |
198
click to vote
PACT
2009
Springer
16 years 1 months ago
2009
Springer
The notion of Fast Fourier Transformation (FFT) describes a range of efficient algorithms to compute the discrete Fourier transformation, frequency distribution in a signal. FFT pl...
156
click to vote
SEMWEB
2009
Springer
16 years 1 months ago
2009
Springer
In this paper, we consider the problem of materializing the complete finite RDFS closure in a scalable manner; this includes those parts of the RDFS closure that are often ignored...
189
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
In this work we present a method to perform a complete audiovisual source separation without need of previous information. This method is based on the assumption that sounds are c...
179
click to vote
ICASSP
2008
IEEE
16 years 1 months ago
2008
IEEE
This paper describes an algorithm that performs a simple form of computational auditory scene analysis to separate multiple speech signals from one another on the basis of the mod...
191
click to vote
ICPP
2008
IEEE
16 years 1 months ago
2008
IEEE
Abstract— We examine the problem of parallelizing the inferencing process for OWL knowledge-bases. A key challenge in this problem is partitioning the computational workload of t...