Sciweavers

16257 search results - page 411 / 3252
» D-finiteness: algorithms and applications
Sort
View
DFT
2002
IEEE
127views VLSI» more  DFT 2002»
15 years 12 months ago
A New Functional Fault Model for FPGA Application-Oriented Testing
1 The objective of this paper is to propose a new fault model suitable for test pattern generation for an FPGA configured to implement a given application. The paper demonstrates t...
Maurizio Rebaudengo, Matteo Sonza Reorda, Massimo ...
HPDC
2002
IEEE
15 years 12 months ago
Decoupling Computation and Data Scheduling in Distributed Data-Intensive Applications
In high energy physics, bioinformatics, and other disciplines, we encounter applications involving numerous, loosely coupled jobs that both access and generate large data sets. So...
Kavitha Ranganathan, Ian T. Foster
BICOB
2010
Springer
15 years 11 months ago
Folding-aware and Structure-conscious 3D Substructures in Folding Data: Identification and Applications
Molecular dynamics simulations have been employed by biologists to study the protein folding problem. Such simulations have resulted in a large number of protein folding trajector...
Hui Yang, Saurabh Gupte, Runtang Wang, Rahul Parte
ICMCS
1999
IEEE
130views Multimedia» more  ICMCS 1999»
15 years 11 months ago
Dynamic Window-Constrained Scheduling for Multimedia Applications
This paper describes an algorithm, called Dynamic Window-Constrained Scheduling (DWCS), designed to meet the service constraints on packets from multiple, network-bound media stre...
Richard West, Karsten Schwan
IPPS
1999
IEEE
15 years 11 months ago
Parallel Out-of-Core Divide-and-Conquer Techniques with Application to Classification Trees
Classification is an important problem in the field of data mining. Construction of good classifiers is computationally intensive and offers plenty of scope for parallelization. D...
Mahesh K. Sreenivas, Khaled Alsabti, Sanjay Ranka