Filtrer vos résultats
- 194
- 106
- 19
- 19
- 17
- 16
- 9
- 2
- 2
- 2
- 1
- 1
- 1
- 381
- 37
- 36
- 30
- 23
- 21
- 20
- 16
- 16
- 16
- 14
- 13
- 13
- 12
- 11
- 11
- 11
- 11
- 10
- 10
- 10
- 9
- 9
- 9
- 9
- 8
- 8
- 8
- 8
- 8
- 8
- 8
- 7
- 7
- 7
- 7
- 7
- 7
- 7
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 346
- 231
- 48
- 32
- 13
- 3
- 2
- 336
- 335
- 62
- 60
- 38
- 36
- 24
- 23
- 15
- 14
- 14
- 13
- 13
- 13
- 12
- 12
- 12
- 11
- 10
- 9
- 9
- 8
- 8
- 8
- 7
- 7
- 7
- 6
- 6
- 6
- 5
- 5
- 5
- 5
- 4
- 4
- 4
- 4
- 4
- 3
- 3
- 3
- 3
- 3
- 3
- 3
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 2
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 1
- 386
- 381
- 379
- 361
- 361
- 361
- 361
- 361
- 361
- 361
- 361
- 358
- 343
- 343
- 343
- 336
- 336
- 335
- 278
- 257
- 250
- 212
- 179
- 139
- 106
- 103
- 103
- 95
- 71
- 64
- 64
- 64
- 64
- 60
- 60
- 60
- 60
- 59
- 38
- 36
- 28
- 26
- 26
- 26
- 24
- 24
- 23
- 23
- 20
- 20
- 19
- 19
- 19
- 19
- 19
- 19
- 19
- 18
- 18
- 17
- 16
- 16
- 16
- 16
- 16
- 15
- 15
- 14
- 14
- 14
- 14
- 14
- 13
- 13
- 13
- 13
- 13
- 12
- 12
- 11
- 11
- 11
- 11
- 11
- 11
- 11
- 11
- 10
- 10
- 10
- 10
- 10
- 10
- 9
- 9
- 9
- 9
- 9
- 9
- 9
- 340
- 28
- 19
- 2
- 27
- 360
- 28
- 1
- 2
- 1
- 1
- 1
- 5
- 3
- 15
- 9
- 14
- 14
- 14
- 12
- 17
- 18
- 24
- 21
- 25
- 24
- 25
- 20
- 19
- 19
- 22
- 13
- 11
- 12
- 24
- 4
389 résultats
|
A counter-example to the general convergence of partially greedy algorithmsJournal of Approximation Theory, 2001, 111 (1), pp.128-138. ⟨10.1006/jath.2001.3556⟩
Article dans une revue
inria-00576644v1
|
||
Partially Greedy AlgorithmsTrends in Approximation Theory, May 2000, Nashville, TN, United States. pp.143-148
Communication dans un congrès
inria-00576650v1
|
|||
|
Approximate Weak Greedy AlgorithmsAdvances in Computational Mathematics, 2001, 14 (4), pp.361-378. ⟨10.1023/A:1012255021470⟩
Article dans une revue
istex
inria-00576643v1
|
||
Classification et détection de signaux à l'aide de la transformée en ondelettesActes des rencontres 1998 de la Société Francophone de Classification (SFC'98), Sep 1998, Montpellier, France
Communication dans un congrès
inria-00576653v1
|
|||
|
On some mathematical aspects of sparse modelingMathematics [math]. Université Rennes 1, 2007
HDR
tel-00564045v1
|
||
|
Fast Matching Pursuit with a multiscale dictionary of Gaussian ChirpsIEEE Transactions on Signal Processing, 2001, 49 (5), pp.994-1001. ⟨10.1109/78.917803⟩
Article dans une revue
inria-00576201v1
|
||
ParcimonieComon, Pierre and Jutten, Christian. Séparation de sources 2 -- au delà de l'aveugle et applications, Hermès-Sciences, pp.395--441, 2007
Chapitre d'ouvrage
inria-00544977v1
|
|||
|
MPTK: Matching Pursuit made TractableAcoustics, Speech and Signal Processing, 2006. ICASSP 2006 Proceedings. 2006 IEEE International Conference on, May 2006, Toulouse, France. pp.III-496 -- III-499, ⟨10.1109/ICASSP.2006.1660699⟩
Communication dans un congrès
inria-00544919v1
|
||
Sparse Component AnalysisComon, Pierre and Jutten, Christian. Handbook of Blind Source Separation, Independent Component Analysis and Applications, Academic Press, pp.367--420, 2010
Chapitre d'ouvrage
inria-00541853v1
|
|||
Linear time-frequency analysis I:Fourier-type representationsHlawatsch, Franz and Auger, François. Time--Frequency Analysis: Concepts and Methods, Wiley, pp.69--99, 2008, ⟨10.1002/9780470611203⟩
Chapitre d'ouvrage
inria-00544966v1
|
|||
|
Sparse decomposition of stereo signals with Matching Pursuit and application to blind separation of more than two sources from a stereo mixtureIEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP 2002), 2002, Orlando, Florida, United States. pp.III/3057 -- III/3060, ⟨10.1109/ICASSP.2002.1005332⟩
Communication dans un congrès
inria-00574786v1
|
||
|
Some uniqueness results in sparse convolutive source separationInternational Conference on Latent Variable Analysis and Source Separation, Mar 2012, Tel Aviv, Israel
Communication dans un congrès
hal-00659913v1
|
||
|
An Overview of Analysis vs Synthesis in Low-Dimensional Signal ModelsSPARS'11, Jun 2011, Edinburgh, United Kingdom
Communication dans un congrès
inria-00624355v1
|
||
|
Decision trees with improved efficiency for fast speaker verification9th European Conference on Speech Communication and Technology, Proceedings of (INTERSPEECH-2005), Sep 2005, Lisbonne, Portugal. pp.3077--3080
Communication dans un congrès
inria-00564509v1
|
||
|
A robust method to count and locate audio sources in a multichannel underdetermined mixtureIEEE Transactions on Signal Processing, 2010, 58 (1), pp.121--133. ⟨10.1109/TSP.2009.2030854⟩
Article dans une revue
inria-00489529v1
|
||
|
A Robust Method to Count and Locate Audio Sources in a Stereophonic Linear Anechoic MixtureProc. IEEE Intl. Conf. Acoust. Speech Signal Process (ICASSP'07), Apr 2007, Honolulu, Hawai, United States. pp.III-745 - III-748, ⟨10.1109/ICASSP.2007.366787⟩
Communication dans un congrès
inria-00544778v1
|
||
|
A Robust Method to Count and Locate Audio Sources in a Stereophonic Linear Instantaneous MixtureProc. of the Int'l. Workshop on Independent Component Analysis and Blind Signal Separation (ICA 2006), Mar 2006, Charleston, South Carolina, United States. pp.536--543, ⟨10.1007/11679363_67⟩
Communication dans un congrès
inria-00544925v1
|
||
Bearing failure detection using matching pursuitNDT & E International, 2002, 35 (4), pp.255-262. ⟨10.1016/S0963-8695(01)00063-9⟩
Article dans une revue
istex
inria-00576214v1
|
|||
Analyse temps-fréquence linéaire I : Représentations type FourierHlawatsch, Franz and Auger, François. Temps-fréquence : concepts et outils, Hermès-Sciences, pp.69--99, 2005
Chapitre d'ouvrage
inria-00564512v1
|
|||
|
Analysis of Sound Signals with High Resolution Matching PursuitProc. IEEE Symp. Time-Freq. and Time-Scale Anal. (TFTS'96), Jun 1996, Paris, France. pp.125-128, ⟨10.1109/TFSA.1996.546702⟩
Communication dans un congrès
inria-00576196v1
|
||
Sound Signals Decomposition Using a High Resolution Matching PursuitProc. Int. Computer Music Conf. (ICMC'96), Aug 1996, Hong-Kong, Hong Kong SAR China. pp.293-296
Communication dans un congrès
inria-00576655v1
|
|||
|
Approximations non-linéaires pour l'analyse de signaux sonoresMathématiques [math]. Université Paris Dauphine - Paris IX, 1999. Français. ⟨NNT : ⟩
Thèse
tel-00583662v1
|
||
|
From projection pursuit and CART to adaptive discriminant analysis?IEEE Transactions on Neural Networks, 2005, 16 (3), pp.522--532. ⟨10.1109/TNN.2005.844900⟩
Article dans une revue
inria-00564479v1
|
||
|
A survey of Sparse Component Analysis for blind source separation: principles, perspectives, and new challengesESANN'06 proceedings - 14th European Symposium on Artificial Neural Networks, Apr 2006, Bruges, Belgium. pp.323--330
Communication dans un congrès
inria-00544897v1
|
||
|
Dictionary Identification - Sparse Matrix-Factorisation via $\ell_1$-MinimisationIEEE Transactions on Information Theory, 2010, 56 (7), pp.3523--3539. ⟨10.1109/TIT.2010.2048466⟩
Article dans une revue
hal-00541297v1
|
||
|
Should penalized least squares regression be interpreted as Maximum A Posteriori estimation?IEEE Transactions on Signal Processing, 2011, 59 (5), pp.2405-2410. ⟨10.1109/TSP.2011.2107908⟩
Article dans une revue
inria-00486840v4
|
||
|
Piecewise Linear Source SeparationProc. SPIE '03, Aug 2003, San Diego, CA, United States. pp.297-310, ⟨10.1117/12.504790⟩
Communication dans un congrès
inria-00576207v1
|
||
|
Sparse filter models for solving permutation indeterminacy in convolutive blind source separationSPARS'09 - Signal Processing with Adaptive Sparse Structured Representations, Inria Rennes - Bretagne Atlantique, Apr 2009, Saint Malo, France
Communication dans un congrès
inria-00369554v1
|
||
|
Well-posedness of the frequency permutation problem in sparse filter estimation with lp minimizationSignal Processing with Adaptive Sparse Structured Representations, Jun 2011, Edinburgh, United Kingdom
Communication dans un congrès
inria-00587789v1
|
||
|
Probabilistic scoring using decision trees for fast and scalable speaker recognitionSpeech Communication, 2009, 51 (11), pp.1065 - 1081. ⟨10.1016/j.specom.2009.02.007⟩
Article dans une revue
inria-00544959v1
|