Sciweavers

10805 search results - page 307 / 2161
» Mapping Computation with No Memory
Sort
View
INTERACTION
2009
ACM
16 years 1 months ago
A binary method for fast computation of inter and intra cluster similarities for combining multiple clusterings
In this paper, we introduce a novel binary method for fast computation of an objective function to measure inter and intra class similarities, which is used for combining multiple...
Selim Mimaroglu, A. Murat Yagci
IPPS
2007
IEEE
16 years 1 months ago
Reconfigurable Architecture for Biological Sequence Comparison in Reduced Memory Space
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...
Azzedine Boukerche, Jan Mendonca Correa, Alba Cris...
HIPC
2004
Springer
16 years 3 days ago
A Shared Memory Dispatching Approach for Partially Clairvoyant Schedulers
It is well known that in a typical real-time system, certain parameters, such as the execution time of a job, are not fixed numbers. In such systems, it is common to characterize ...
K. Subramani, Kiran Yellajyosula
FPL
1999
Springer
80views Hardware» more  FPL 1999»
15 years 11 months ago
An Internet Based Development Framework for Reconfigurable Computing
The paper presents a development framework for the Xputer prototype Map-oriented Machine with Parallel Data Access (MoM-PDA). The MoM-PDA operates as a reconfigurable accelerator t...
Reiner W. Hartenstein, Michael Herz, Ulrich Nageld...
ASPDAC
2001
ACM
126views Hardware» more  ASPDAC 2001»
15 years 10 months ago
A new partitioning scheme for improvement of image computation
Abstract-- Image computation is the core operation for optimization and formal verification of sequential systems like controllers or protocols. State exploration techniques based ...
Christoph Meinel, Christian Stangier