Sciweavers

1670 search results - page 4 / 334
» Fast Computation of Data Correlation Using BDDs
Sort
View
DAC
1999
ACM
14 years 22 days ago
Using Lower Bounds During Dynamic BDD Minimization
Ordered Binary Decision Diagrams BDDs are a data structure for representation and manipulation of Boolean functions often applied in VLSI CAD. The choice of the variable orderin...
Rolf Drechsler, Wolfgang Günther
ICML
2003
IEEE
14 years 9 months ago
Feature Selection for High-Dimensional Data: A Fast Correlation-Based Filter Solution
Feature selection, as a preprocessing step to machine learning, has been effective in reducing dimensionality, removing irrelevant data, increasing learning accuracy, and improvin...
Lei Yu, Huan Liu
PKDD
2005
Springer
159views Data Mining» more  PKDD 2005»
14 years 1 months ago
Fast Burst Correlation of Financial Data
We examine the problem of monitoring and identification of correlated burst patterns in multi-stream time series databases. Our methodology is comprised of two steps: a burst dete...
Michail Vlachos, Kun-Lung Wu, Shyh-Kwei Chen, Phil...
CAP
2010
13 years 3 months ago
Parallel disk-based computation for large, monolithic binary decision diagrams
Binary Decision Diagrams (BDDs) are widely used in formal verification. They are also widely known for consuming large amounts of memory. For larger problems, a BDD computation wi...
Daniel Kunkle, Vlad Slavici, Gene Cooperman
ISNN
2007
Springer
14 years 2 months ago
Fast Code Detection Using High Speed Time Delay Neural Networks
This paper presents a new approach to speed up the operation of time delay neural networks for fast code detection. The entire data are collected together in a long vector and then...
Hazem M. El-Bakry, Nikos E. Mastorakis