ICASSP
2011
IEEE
13 years 4 months ago
2011
IEEE
In this paper an algorithm based on the ensemble empirical mode decomposition (EEMD) is presented. The key idea on the EEMD relies on averaging the modes obtained by EMD applied t...
TASLP
2011
13 years 7 months ago
2011
—Time-domain algorithms for blind separation of audio sources can be classified as being based either on a partial or complete decomposition of an observation space. The decompo...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
In this paper we show how we can compute in a deterministic way the decomposition of a multivariate rational function with a recombination strategy. The key point of our recombinat...
ISAMI
2010
13 years 10 months ago
2010
Many adaptative context-aware middleware exist and most of them rely on so-called vertical architectures that offer a functional decomposition for contextawareness. This architectu...
ASPDAC
2010
ACM
13 years 10 months ago
2010
ACM
As Double Patterning Lithography(DPL) becomes the leading candidate for sub-30nm lithography process, we need a fast and lithography friendly decomposition framework. In this pape...
PRL
2007
14 years 1 days ago
2007
A decomposition scheme for 3D fuzzy objects is presented. The decomposition is guided by a fuzzy distance transform (FDT) of the fuzzy object and aims to decompose the fuzzy objec...
TVLSI
1998
14 years 5 days ago
1998
Abstract— The growing popularity of look-up table (LUT)based field programmable gate arrays (FPGA’s) has renewed the interest in functional or Roth–Karp decomposition techni...
AI
1999
Springer
14 years 6 days ago
1999
Springer
We present a new machine learning method that, given a set of training examples, induces a definition of the target concept in terms of a hierarchy of intermediate concepts and th...
COMGEO
2002
ACM
14 years 11 days ago
2002
ACM
We present a quadtree-based decomposition of the interior of a polygon with holes. The complete decomposition yields a constant factor approximation of the minimum weight Steiner ...
COMBINATORICS
2004
14 years 12 days ago
2004
In the 1960's, Tutte presented a decomposition of a 2-connected finite graph into 3-connected graphs, cycles and bonds. This decomposition has been used to reduce problems on...