1021 search results - page 17 / 205 » Fast Approximate PCPs |
EUROPAR
2010
Springer
13 years 7 months ago
2010
Springer
We present in this article a new approximation algorithm for scheduling a set of n independent rigid (meaning requiring a fixed number of processors) jobs on hierarchical parallel ...
CIKM
2010
Springer
13 years 6 months ago
2010
Springer
Pseudo-relevance feedback (PRF) improves search quality by expanding the query using terms from high-ranking documents from an initial retrieval. Although PRF can often result in ...
GCB
2004
Springer
14 years 1 months ago
2004
Springer
: The main contribution of this paper is a novel approach for fast searching in huge structural databases like the PDB. The data structure is based on an adaption of the generalize...
ISAAC
2005
Springer
14 years 1 months ago
2005
Springer
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
SODA
2008
ACM
13 years 9 months ago
2008
ACM
Approximation of the permanent of a matrix with nonnegative entries is a well studied problem. The most successful approach to date for general matrices uses Markov chains to appr...