6105 search results - page 860 / 1221 » A Parallel Algorithm for Bound-Smoothing |
166
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
The isomorphism problem for planar graphs is known to be efficiently solvable. For planar 3-connected graphs, the isomorphism problem can be solved by efficient parallel algorithm...
194
click to vote
CORR
2011
Springer
15 years 1 months ago
2011
Springer
—We present a new model for distributed shared memory systems, based on remote data accesses. Such features are offered by network interface cards that allow one-sided operations...
156
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
In this paper, we consider the source-channel rate allocation for different transmission schemes. We propose a new trellis structure and a new algorithm that are able to deal with...
176
click to vote
HPCA
2006
IEEE
16 years 7 months ago
2006
IEEE
Allowing loads to issue out-of-order with respect to earlier unresolved store addresses is very important for extracting parallelism in large-window superscalar processors. Blindl...
185
click to vote
IPPS
2006
IEEE
16 years 23 days ago
2006
IEEE
DHT networks based on consistent hashing functions have an inherent load uneven distribution problem. The objective of DHT load balancing is to balance the workload of the network...