Sciweavers

130 search results - page 9 / 26
» Data Reduction Based on Hyper Relations
Sort
View
CSL
2010
Springer
13 years 9 months ago
Ordered Sets in the Calculus of Data Structures
Our goal is to identify families of relations that are useful for reasoning about software. We describe such families using decidable quantifier-free classes of logical constraints...
Viktor Kuncak, Ruzica Piskac, Philippe Suter
VTS
2003
IEEE
122views Hardware» more  VTS 2003»
14 years 1 months ago
A Reconfigurable Shared Scan-in Architecture
In this paper, an efficient technique for test data volume reduction based on the shared scan-in (Illinois Scan) architecture and the scan chain reconfiguration (Dynamic Scan) arc...
Samitha Samaranayake, Emil Gizdarski, Nodari Sitch...
KDD
1995
ACM
148views Data Mining» more  KDD 1995»
13 years 12 months ago
Learning Arbiter and Combiner Trees from Partitioned Data for Scaling Machine Learning
Knowledge discovery in databases has become an increasingly important research topic with the advent of wide area network computing. One of the crucial problems we study in this p...
Philip K. Chan, Salvatore J. Stolfo
SDM
2009
SIAM
180views Data Mining» more  SDM 2009»
14 years 5 months ago
Hierarchical Linear Discriminant Analysis for Beamforming.
This paper demonstrates the applicability of the recently proposed supervised dimension reduction, hierarchical linear discriminant analysis (h-LDA) to a well-known spatial locali...
Barry L. Drake, Haesun Park, Jaegul Choo
KBS
2008
98views more  KBS 2008»
13 years 6 months ago
Mixed feature selection based on granulation and approximation
Feature subset selection presents a common challenge for the applications where data with tens or hundreds of features are available. Existing feature selection algorithms are mai...
Qinghua Hu, Jinfu Liu, Daren Yu