5595 search results - page 882 / 1119 » Approximation Algorithms for Clustering Problems |
200
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...
194
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...
156
click to vote
ISSAC
2007
Springer
16 years 23 days ago
2007
Springer
Through the use of a new disk-based method for enumerating very large orbits, condensation for orbits with tens of billions of elements can be performed. The algorithm is novel in...
182
click to vote
SIGIR
2005
ACM
16 years 5 days ago
2005
ACM
Memory-based approaches for collaborative filtering identify the similarity between two users by comparing their ratings on a set of items. In the past, the memory-based approache...
174
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
Dimensionality reduction is a commonly used step in many algorithms for visualization, classification, clustering and modeling. Most dimensionality reduction algorithms find a low...