492 search results - page 40 / 99 » The number of possibilities for random dating |
ISCA
2008
IEEE
15 years 4 months ago
2008
IEEE
Modern processors rely on memory dependence prediction to execute load instructions as early as possible, speculating that they are not dependent on an earlier, unissued store. To...
100
Voted
RTSS
2007
IEEE
15 years 4 months ago
2007
IEEE
We present a performance analysis technique for distributed real-time systems in a setting where certain components are modeled in a purely functional manner, while the remainin...
84
Voted
IMA
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. The asymptotic security of the Blum-Blum-Shub (BBS) pseudorandom generator has been studied by Alexi et al. and Vazirani and Vazirani, who proved independently that O(log...
EMMCVPR
2001
Springer
15 years 2 months ago
2001
Springer
After [15, 31, 19, 8, 25, 5] minimum cut/maximum flow algorithms on graphs emerged as an increasingly useful tool for exact or approximate energy minimization in low-level vision...
101
Voted
WCNC
2010
IEEE
15 years 2 months ago
2010
IEEE
—The selection of high-throughput routes is a key element towards improving the performance of wireless multihop networks. While several routing metrics have been proposed in the...