Sciweavers

6105 search results - page 301 / 1221
» A Parallel Algorithm for Bound-Smoothing
Sort
View
APL
1993
ACM
15 years 10 months ago
Identification of Parallelism in Neural Networks by Simulation with Language J.
: The problem of a finding of ranging of the objects nearest to the cyclic relation set by the expert between objects is considered. Formalization of the problem arising at it is r...
Alexei N. Skurikhin, Alvin J. Surkan
CATA
2004
15 years 8 months ago
Parallel Thinning on Rmesh
Thinning operation is a fundamental operation in image processing. It is a typical preprocessing stage for pattern recognition and data compression. In this report we proposed an ...
John Jing-Fu Jenq, Wing Ning Li
PPSN
2010
Springer
15 years 5 months ago
Optimisation and Generalisation: Footprints in Instance Space
Abstract. The chief purpose of research in optimisation is to understand how to design (or choose) the most suitable algorithm for a given distribution of problem instances. Ideall...
David W. Corne, Alan P. Reynolds
IPPS
2002
IEEE
15 years 11 months ago
On Cost-Optimal Merge of Two Intransitive Sorted Sequences
The problem of merging two intransitive sorted sequences (that is, to generate a sorted total order without the transitive property) is considered. A cost-optimal parallel merging...
Jie Wu, Stephan Olariu
VLSISP
2010
119views more  VLSISP 2010»
15 years 1 months ago
Hardware Acceleration of HMMER on FPGAs
We propose a new parallelization scheme for the hmmsearch function of the HMMER software, in order to target FPGA technology. hmmsearch is a very compute intensive software for bio...
Steven Derrien, Patrice Quinton