Sciweavers

2938 search results - page 126 / 588
» On obfuscating point functions
Sort
View
ICASSP
2010
IEEE
15 years 6 months ago
A new method for kurtosis maximization and source separation
This paper introduces a new method to maximize kurtosisbased contrast functions. Such contrast functions appear in the problem of blind source separation of convolutively mixed so...
Marc Castella, Eric Moreau
IDA
2007
Springer
16 years 16 days ago
DENCLUE 2.0: Fast Clustering Based on Kernel Density Estimation
The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assign...
Alexander Hinneburg, Hans-Henning Gabriel
DFT
1999
IEEE
72views VLSI» more  DFT 1999»
15 years 10 months ago
Yield Estimation of VLSI Circuits with Downscaled Layouts
This paper describes the yield estimation approach to layout scaling of submicron VLSI circuits. The presented method makes it feasible to find scaling factor of the IC design whi...
Witold A. Pleskacz
SAS
1993
Springer
126views Formal Methods» more  SAS 1993»
15 years 10 months ago
Finiteness Conditions for Strictness Analysis
We give upper bounds on the number of times the fixed point operator needs to be unfolded for strictness analysis of functional languages with lists. This extends previous work b...
Flemming Nielson, Hanne Riis Nielson
FSTTCS
2006
Springer
15 years 10 months ago
Coresets for Discrete Integration and Clustering
Given a set P of n points on the real line and a (potentially innite) family of functions, we investigate the problem of nding a small (weighted) subset S P, such that for any f ...
Sariel Har-Peled