Sciweavers

815 search results - page 37 / 163
» Approximate Entropy Reducts
Sort
View
JMLR
2010
108views more  JMLR 2010»
14 years 6 months ago
Sufficient Dimension Reduction via Squared-loss Mutual Information Estimation
The goal of sufficient dimension reduction in supervised learning is to find the lowdimensional subspace of input features that is `sufficient' for predicting output values. ...
Taiji Suzuki, Masashi Sugiyama
VLSID
2006
IEEE
136views VLSI» more  VLSID 2006»
16 years 6 days ago
Improved Data Compression for Serial Interconnected Network on Chip through Unused Significant Bit Removal
Serial links in network on chip provide advantages in terms of reduced wiring area, reduced switch complexity and power. However, serial links offer lower bandwidth in comparison ...
Simon Ogg, Bashir M. Al-Hashimi
DATE
2005
IEEE
128views Hardware» more  DATE 2005»
15 years 5 months ago
Modeling Interconnect Variability Using Efficient Parametric Model Order Reduction
Assessing IC manufacturing process fluctuations and their impacts on IC interconnect performance has become unavoidable for modern DSM designs. However, the construction of parame...
Peng Li, Frank Liu, Xin Li, Lawrence T. Pileggi, S...
AMC
2005
112views more  AMC 2005»
14 years 11 months ago
Stieltjes moment problem via fractional moments
Stieltjes moment problem is considered to recover a probability density function from the knowledge of its infinite sequence of ordinary moments. The approximate density is obtain...
Pierluigi Novi Inverardi, Alberto Petri, Giorgio P...
ICFP
2003
ACM
15 years 11 months ago
Representing reductions of NP-complete problems in logical frameworks: a case study
Under the widely believed conjecture P=NP, NP-complete problems cannot be solved exactly using efficient polynomial time algorithms. Furthermore, any instance of a NP-complete pro...
Carsten Schürmann, Jatin Shah