Sciweavers

520 search results - page 25 / 104
» Computing recombination networks from binary sequences
Sort
View
IPPS
1997
IEEE
15 years 2 months ago
On the Dynamic Initialization of Parallel Computers
Abstract. The incremental and dynamic construction of interconnection networks from smaller components often leaves the fundamental problem of assigning addresses to processors to ...
Stephan Olariu, Ivan Stojmenovic, Albert Y. Zomaya
IPPS
2000
IEEE
15 years 2 months ago
Reducing Ownership Overhead for Load-Store Sequences in Cache-Coherent Multiprocessors
Parallel programs that modify shared data in a cachecoherent multiprocessor with a write-invalidate coherence protocol create ownership overhead in the form of ownership acquisiti...
Jim Nilsson, Fredrik Dahlgren
CLUSTER
2002
IEEE
15 years 2 months ago
Scalable Resource Management in High Performance Computers
Clusters of workstations have emerged as an important platform for building cost-effective, scalable, and highlyavailable computers. Although many hardware solutions are available...
Eitan Frachtenberg, Fabrizio Petrini, Juan Fern&aa...
MOBIHOC
2010
ACM
14 years 7 months ago
Longest-queue-first scheduling under SINR interference model
We investigate the performance of longest-queue-first (LQF) scheduling (i.e., greedy maximal scheduling) for wireless networks under the SINR interference model. This interference...
Long Bao Le, Eytan Modiano, Changhee Joo, Ness B. ...
SOCO
2008
Springer
14 years 9 months ago
A face recognition system based on Pseudo 2D HMM applied to neural network coefficients
Face recognition from an image or video sequences is emerging as an active research area with numerous commercial and law enforcement applications. In this paper different Pseudo 2...
Vitoantonio Bevilacqua, Lucia Cariello, Gaetano Ca...