417 search results - page 7 / 84 » Running Time Predictions for Factoring Algorithms |
COMPGEOM
2005
ACM
14 years 11 months ago
2005
ACM
Given a Euclidean graph G in Rd with n vertices and m edges we consider the problem of adding a shortcut such that the stretch factor of the resulting graph is minimized. Currentl...
ESA
2006
Springer
15 years 1 months ago
2006
Springer
The objective of this paper is to characterize classes of problems for which a greedy algorithm finds solutions provably close to optimum. To that end, we introduce the notion of k...
89
Voted
ICDIM
2010
IEEE
14 years 7 months ago
2010
IEEE
Recommender systems have been proposed to exploit the potential of social network by filtering the information and offer recommendations to a user that he is predicted to like. Co...
PDPTA
2004
14 years 11 months ago
2004
We present the MBRAM model for static evaluation of the performance of memory-bound programs. The MBRAM model predicts the actual running time of a memory-bound program directly fr...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
: We give the first combinatorial approximation algorithm for MAXCUT that beats the trivial 0.5 factor by a constant. The main partitioning procedure is very intuitive, natural, an...