Sciweavers

435 search results - page 48 / 87
» Design and Implementation of Parallel Counterpropagation Net...
Sort
View
JPDC
2006
134views more  JPDC 2006»
13 years 7 months ago
Fast shared-memory algorithms for computing the minimum spanning forest of sparse graphs
Minimum Spanning Tree (MST) is one of the most studied combinatorial problems with practical applications in VLSI layout, wireless communication, and distributed networks, recent ...
David A. Bader, Guojing Cong
IPPS
2005
IEEE
14 years 1 months ago
Stream PRAM
Parallel random access memory, or PRAM, is a now venerable model of parallel computation that that still retains its usefulness for the design and analysis of parallel algorithms....
Darrell R. Ulm, Michael Scherger
PARA
1994
Springer
13 years 11 months ago
Parallel Computation of the Eigenstructure of Toeplitz-plus-Hankel Matrices on Multicomputers
In this paper we present four parallel algorithms to compute any group of eigenvalues and eigenvectors of a Toeplitz-plus-Hankel matrix. These algorithms parallelize a method that...
José M. Badía, Antonio M. Vidal
IPPS
2007
IEEE
14 years 1 months ago
Securing Grid Data Transfer Services with Active Network Portals
Widely available and utilized Grid servers are vulnerable to a variety of threats from Denial of Service (DoS) attacks, overloading caused by flash crowds, and compromised client ...
Onur Demir, Michael R. Head, Kanad Ghose, Madhusud...
EMSOFT
2004
Springer
14 years 1 months ago
Loose synchronization of event-triggered networks for distribution of synchronous programs
Dataflow synchronous languages have attracted considerable interest in domains such as real-time control and hardware design. The potential benefits are promising: Discrete-time...
Jan Romberg, Andreas Bauer 0002