417 search results - page 62 / 84 » Running Time Predictions for Factoring Algorithms |
73
Voted
DATE
2005
IEEE
15 years 3 months ago
2005
IEEE
Conventional cache models are not suited for real-time parallel processing because tasks may flush each other’s data out of the cache in an unpredictable manner. In this way th...
CASES
2007
ACM
15 years 1 months ago
2007
ACM
The memory intensive nature of object-oriented languages such as C++ and Java has created the need of a high-performance dynamic memory management (DMM); however, it is a challeng...
80
Voted
EDBT
2006
ACM
15 years 9 months ago
2006
ACM
Abstract. Comparison of images requires a distance metric that is sensitive to the spatial location of objects and features. Such sensitive distance measures can, however, be compu...
116
click to vote
GRID
2010
Springer
14 years 7 months ago
2010
Springer
Abstract The EGEE grid offers the necessary infrastructure and resources for reducing the running time of particle tracking Monte-Carlo applications like GATE. However, efforts are...
105
Voted
KDD
2012
ACM
13 years 2 days ago
2012
ACM
Building an accurate emerging pattern classifier with a highdimensional dataset is a challenging issue. The problem becomes even more difficult if the whole feature space is unava...