2107 search results - page 146 / 422 » Computing Small Search Numbers in Linear Time |
117
Voted
PPOPP
2010
ACM
15 years 5 months ago
2010
ACM
Helper locks allow programs with large parallel critical sections, called parallel regions, to execute more efficiently by enlisting processors that might otherwise be waiting on ...
130
Voted
IPPS
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper, we present a novel approach for parallel sorting on stream processing architectures. It is based on adaptive bitonic sorting. For sorting n values utilizing p strea...
110
Voted
MIDDLEWARE
2004
Springer
15 years 9 months ago
2004
Springer
Peer-to-peer (P2P) systems are becoming increasingly popular and complex, serving millions of users today. However, the design of current unstructured P2P systems does not take ful...
159
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
In this paper, we propose an efficient acquisition scheme for GPS receivers. It is shown that GPS signals can be effectively sampled and detected using a bank of randomized corre...
105
click to vote
JCSS
2008
15 years 3 months ago
2008
The cornerstone of any algorithm computing all repetitions in strings of length n in O(n) time is the fact that the number of maximal repetitions (runs) is linear. Therefore, the ...