Sciweavers

9359 search results - page 883 / 1872
» Generalization Algorithms for Second-Order Terms
Sort
View
KDD
2004
ACM
157views Data Mining» more  KDD 2004»
16 years 1 months ago
Fast mining of spatial collocations
Spatial collocation patterns associate the co-existence of nonspatial features in a spatial neighborhood. An example of such a pattern can associate contaminated water reservoirs ...
Xin Zhang, Nikos Mamoulis, David W. Cheung, Yutao ...
GLVLSI
2003
IEEE
153views VLSI» more  GLVLSI 2003»
16 years 28 days ago
FORCE: a fast and easy-to-implement variable-ordering heuristic
The MINCE heuristic for variable-ordering [1] successfully reduces the size of BDDs and can accelerate SAT-solving. Applications to reachability analysis have also been successful...
Fadi A. Aloul, Igor L. Markov, Karem A. Sakallah
GLVLSI
2003
IEEE
132views VLSI» more  GLVLSI 2003»
16 years 28 days ago
A highly regular multi-phase reseeding technique for scan-based BIST
In this paper a novel reseeding architecture for scan-based BIST, which uses an LFSR as TPG, is proposed. Multiple cells of the LFSR are utilized as sources for feeding the scan c...
Emmanouil Kalligeros, Xrysovalantis Kavousianos, D...
DAC
2003
ACM
16 years 27 days ago
Fast timing-driven partitioning-based placement for island style FPGAs
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
Pongstorn Maidee, Cristinel Ababei, Kia Bazargan
DAC
2003
ACM
16 years 27 days ago
Test application time and volume compression through seed overlapping
We propose in this paper an extension on the Scan Chain Concealment technique to further reduce test time and volume requirement. The proposed methodology stems from the architect...
Wenjing Rao, Ismet Bayraktaroglu, Alex Orailoglu