Sciweavers

56 search results - page 7 / 12
» Extended Boolean Matrix Decomposition
Sort
View
ICASSP
2011
IEEE
12 years 11 months ago
Sparse non-negative decomposition of speech power spectra for formant tracking
Many works on speech processing have dealt with auto-regressive (AR) models for spectral envelope and formant frequency estimation, mostly focusing on the estimation of the AR par...
Jean-Louis Durrieu, Jean-Philippe Thiran
TCS
2011
13 years 2 months ago
Dynamic normal forms and dynamic characteristic polynomial
Abstract. We present the first fully dynamic algorithm for computing the characteristic polynomial of a matrix. In the generic symmetric case our algorithm supports rank-one updat...
Gudmund Skovbjerg Frandsen, Piotr Sankowski
COMPGEOM
2006
ACM
14 years 1 months ago
Colored intersection searching via sparse rectangular matrix multiplication
In a Batched Colored Intersection Searching Problem (CI), one is given a set of n geometric objects (of a certain class). Each object is colored by one of c colors, and the goal i...
Haim Kaplan, Micha Sharir, Elad Verbin
IJCNN
2006
IEEE
14 years 1 months ago
Generalizing Independent Component Analysis for Two Related Data Sets
— We introduce in this paper methods for finding mutually corresponding dependent components from two different but related data sets in an unsupervised (blind) manner. The basi...
Juha Karhunen, Tomas Ukkonen
ICRA
2010
IEEE
107views Robotics» more  ICRA 2010»
13 years 6 months ago
Fast resolution of hierarchized inverse kinematics with inequality constraints
— Classically, the inverse kinematics is performed by computing the singular value decomposition of the matrix to invert. This enables a very simple writing of the algorithm. How...
Adrien Escande, Nicolas Mansard, Pierre-Brice Wieb...