417 search results - page 41 / 84 » Running Time Predictions for Factoring Algorithms |
MVA
1990
14 years 11 months ago
1990
This paper describesthe two components: thinning and vectorization,at the front end of a GeographicInformation System. The raster dataset associatedwith a map is very large. A sma...
STOC
2004
ACM
15 years 10 months ago
2004
ACM
In this paper we present a sublinear time (1+ )-approximation randomized algorithm to estimate the weight of the minimum spanning tree of an n-point metric space. The running time...
PDPTA
2000
14 years 11 months ago
2000
Exploiting compile time knowledge to improve memory bandwidth can produce noticeable improvements at run-time [13, 1]. Allocating the data structure [13] to separate memories when...
DAC
2009
ACM
15 years 10 months ago
2009
ACM
Caches are notorious for their unpredictability. It is difficult or even impossible to predict if a memory access will result in a definite cache hit or miss. This unpredictabilit...
SODA
2000
ACM
14 years 11 months ago
2000
ACM
In this paper we give approximation algorithms for several proximity problems in high dimensional spaces. In particular, we give the rst Las Vegas data structure for (1 + )-neares...