1170 search results - page 61 / 234 » How Fast Is Too Fast |
117
click to vote
AAAI
1998
15 years 4 months ago
1998
Probabilistic models have recently been utilized for the optimization of large combinatorial search problems. However, complex probabilistic models that attempt to capture interpa...
128
click to vote
JPDC
2008
15 years 2 months ago
2008
This paper presents an algorithm for fast sorting of large lists using modern GPUs. The method achieves high speed by efficiently utilizing the parallelism of the GPU throughout th...
130
click to vote
VLSISP
2008
15 years 2 months ago
2008
Advanced bit manipulation operations are not efficiently supported by commodity word-oriented microprocessors. Programming tricks are typically devised to shorten the long sequence...
126
click to vote
HPDC
2010
IEEE
15 years 4 months ago
2010
IEEE
iFlow is a replication-based system that can achieve both fast and reliable processing of high volume data streams on the Internet scale. iFlow uses a low degree of replication in...
114
click to vote
ICIP
2006
IEEE
16 years 4 months ago
2006
IEEE
We propose an integral image based algorithm to extract feature covariance matrices of all possible rectangular regions within a given image. Covariance is an essential indicator ...