Sciweavers

874 search results - page 9 / 175
» Practical Algorithms for Selection on Coarse-Grained Paralle...
Sort
View
IPPS
1996
IEEE
13 years 11 months ago
Practical Parallel Algorithms for Dynamic Data Redistribution, Median Finding, and Selection
A common statistical problem is that of nding the median element in a set of data. This paper presents a fastand portable parallel algorithm for nding the median given a set of el...
David A. Bader, Joseph JáJá
SIBGRAPI
1999
IEEE
13 years 11 months ago
Parallelizing MPEG Video Encoding using Multiprocessors
Many computer applications are currently using digital video. Recent advances in digital imaging and faster networking infrastructure made this technology very popular, not only fo...
Joao Paulo Kitajima, Denilson Barbosa, Wagner Meir...
AES
2005
Springer
137views Cryptology» more  AES 2005»
13 years 7 months ago
Design of a multimedia processor based on metrics computation
Media-processing applications, such as signal processing, 2D and 3D graphics rendering, and image compression, are the dominant workloads in many embedded systems today. The real-...
Nader Ben Amor, Yannick Le Moullec, Jean-Philippe ...
BMCBI
2010
126views more  BMCBI 2010»
13 years 7 months ago
Cgaln: fast and space-efficient whole-genome alignment
Background: Whole-genome sequence alignment is an essential process for extracting valuable information about the functions, evolution, and peculiarities of genomes under investig...
Ryuichiro Nakato, Osamu Gotoh
IPPS
1998
IEEE
13 years 11 months ago
Random Sampling Techniques in Parallel Computation
Abstract. Random sampling is an important tool in the design of parallel algorithms. Using random sampling it is possible to obtain simple parallel algorithms which are e cient in ...
Rajeev Raman