Sciweavers

613 search results - page 16 / 123
» Finding and Fixing Faults
Sort
View
DFT
2005
IEEE
89views VLSI» more  DFT 2005»
15 years 3 months ago
On-Line Identification of Faults in Fault-Tolerant Imagers
Detection of defective pixels that develop on-line is a vital part of fault tolerant schemes for repairing imagers during operation. This paper presents a new algorithm for the id...
Glenn H. Chapman, Israel Koren, Zahava Koren, Jozs...
SAC
2008
ACM
14 years 9 months ago
Mining fault-tolerant frequent patterns efficiently with powerful pruning
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Jhih-Jie Zeng, Guanling Lee, Chung-Chi Lee
TSMC
2008
93views more  TSMC 2008»
14 years 9 months ago
Selection of DNA Markers
Given a genome, i.e., a long string over a fixed finite alphabet, the problem is to find short (dis)similar substrings. This computationally intensive task has many biological appl...
Hendrik Jan Hoogeboom, Walter A. Kosters, Jeroen F...
EUSAI
2003
Springer
15 years 2 months ago
Find a Meeting
This video demonstrates a highly integrated system for automatically registering, guiding and assisting delegates of a conference. The delegate uses an iPAQ to communicate with a ...
Paul Simons, Yacine Ghamri-Doudane, Sidi-Mohammed ...
SIGMETRICS
2008
ACM
118views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Finding the optimal quantum size: Sensitivity analysis of the M/G/1 round-robin queue
We consider the round robin (RR) scheduling policy where the server processes each job in its buffer for at most a fixed quantum, q, in a round-robin fashion. The processor sharin...
Varun Gupta