6365 search results - page 167 / 1273 » Fast Local Computation Algorithms |
133
click to vote
P2P
2006
IEEE
15 years 11 months ago
2006
IEEE
Peer-to-peer systems (p2p) are highly dynamic in nature. They may consist of millions of peers joining only for a limited period of time, resulting in hundreds of join and leave e...
164
click to vote
GCA
2008
15 years 6 months ago
2008
In a Grid Computing environment, there are various important issues, including information security, resource management, routing, fault tolerance, and so on. Among these issues, ...
115
click to vote
ICCS
2005
Springer
15 years 10 months ago
2005
Springer
We revisit and use the dependence transformation method to generate parallel algorithms suitable for cluster and grid computing. We illustrate this method in two applications: to o...
137
click to vote
CVPR
2003
IEEE
16 years 7 months ago
2003
IEEE
The biological visual system possesses the ability to compute layered surface representations, in which one surface is represented as being viewed through another. This ability is...
116
click to vote
ISCAS
2005
IEEE
15 years 10 months ago
2005
IEEE
— Fast Fourier transform (FFT) algorithms are used in a wide variety of digital signal processing applications and many of these require high-performance parallel implementations...