Sciweavers

1074 search results - page 74 / 215
» Parallelizing post-placement timing optimization
Sort
View
ICDAR
2003
IEEE
14 years 2 months ago
A Low-Cost Parallel K-Means VQ Algorithm Using Cluster Computing
In this paper we propose a parallel approach for the Kmeans Vector Quantization (VQ) algorithm used in a twostage Hidden Markov Model (HMM)-based system for recognizing handwritte...
Alceu de Souza Britto Jr., Paulo Sergio Lopes de S...
IEEECIT
2010
IEEE
13 years 7 months ago
Parallel Best Neighborhood Matching Algorithm Implementation on GPU Platform
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...
Guangyong Zhang, Liqiang He, Yanyan Zhang
FSTTCS
1995
Springer
14 years 14 days ago
Branch and Bound on the Network Model
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
Sanjay Jain
PDCN
2007
13 years 10 months ago
One-to-all personalized communication in torus networks
Given a multicomputer system of parallel processors connected in a torus network, the one-to-all personalized communication is to send from the root processor unique data to each ...
Weizhen Mao, Jie Chen, William A. Watson III
ISCI
2007
103views more  ISCI 2007»
13 years 8 months ago
Threshold-based declustering
Declustering techniques reduce query response time through parallel I/O by distributing data among multiple devices. Except for a few cases it is not possible to find declusterin...
Ali Saman Tosun