794 search results - page 93 / 159 » Challenges in Parallel Graph Processing |
SOFTWARE
2011
13 years 3 months ago
2011
Developing parallel applications is notoriously difficult, but is even more complex for desktop applications. The added difficulties are primarily because of their interactive nat...
HPCN
1999
Springer
14 years 1 months ago
1999
Springer
Abstract. Computational environments used by scientists should provide high-level support for scientific processes that involve the integrated ematic use of familiar abstractions f...
DAGSTUHL
2006
13 years 10 months ago
2006
Current and future communications systems have to provide a large degree of flexibility e.g. to provide multi-service ability, seamless roaming, softinfrastructure upgrading, user-...
ICVS
2009
Springer
14 years 3 months ago
2009
Springer
Abstract. Nearest Neighbor Search (NNS) is employed by many computer vision algorithms. The computational complexity is large and constitutes a challenge for real-time capability. ...
PODC
1996
ACM
14 years 1 months ago
1996
ACM
Drawing ideas from previous authors, we present a new non-blocking concurrent queue algorithm and a new twolock queue algorithm in which one enqueue and one dequeue can proceed co...