417 search results - page 21 / 84 » Running Time Predictions for Factoring Algorithms |
WWW
2011
ACM
14 years 4 months ago
2011
ACM
In social bookmarking systems, existing methods in tag prediction have shown that the performance of prediction can be significantly improved by modeling users’ preferences. Ho...
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We show that the mistake bound for predicting the nodes of an arbitrary weighted graph is characterized (up to logarithmic factors) by the cutsize of a random spanning tree of the...
NSDI
2010
14 years 11 months ago
2010
Today, large-scale web services run on complex systems, spanning multiple data centers and content distribution networks, with performance depending on diverse factors in end syst...
PPL
2008
14 years 9 months ago
2008
The model of bulk-synchronous parallel computation (BSP) helps to implement portable general purpose algorithms while keeping predictable performance on different parallel compute...
ICCAD
2008
IEEE
15 years 6 months ago
2008
IEEE
Abstract— As VLSI technology enters the nanoscale regime, interconnect delay becomes the bottleneck of circuit performance. Compared to gate delays, wires are becoming increasing...