Sciweavers

1964 search results - page 166 / 393
» Partitioning Based Algorithms for Some Colouring Problems
Sort
View
ETS
2006
IEEE
119views Hardware» more  ETS 2006»
14 years 2 months ago
On-Chip Test Generation Using Linear Subspaces
A central problem in built-in self test (BIST) is how to efficiently generate a small set of test vectors that detect all targeted faults. We propose a novel solution that uses l...
Ramashis Das, Igor L. Markov, John P. Hayes
CSE
2008
IEEE
13 years 10 months ago
Exploiting Intensive Multithreading for the Efficient Simulation of 3D Seismic Wave Propagation
Parallel computing is widely used for large scale threedimensional simulation of seismic wave propagation. One particularity of most of these simulations is to consider a finite c...
Fabrice Dupros, Hideo Aochi, Ariane Ducellier, Dim...
TSP
2010
13 years 2 months ago
Universal randomized switching
Abstract--In this paper, we consider a competitive approach to sequential decision problems, suitable for a variety of signal processing applications where at each of a succession ...
Suleyman Serdar Kozat, Andrew C. Singer
PAKDD
2009
ACM
126views Data Mining» more  PAKDD 2009»
14 years 2 months ago
Tree-Based Method for Classifying Websites Using Extended Hidden Markov Models
One important problem proposed recently in the field of web mining is website classification problem. The complexity together with the necessity to have accurate and fast algorit...
Majid Yazdani, Milad Eftekhar, Hassan Abolhassani
TCBB
2010
114views more  TCBB 2010»
13 years 6 months ago
Cache-Oblivious Dynamic Programming for Bioinformatics
— We present efficient cache-oblivious algorithms for some well-studied string problems in bioinformatics including the longest common subsequence, global pairwise sequence alig...
Rezaul Alam Chowdhury, Hai-son Le, Vijaya Ramachan...