Sciweavers

AAAI
1993
13 years 5 months ago
Scientific Model-Building as Search in Matrix Spaces
Many reported discovery systems build discrete models of hidden structure, properties, or processes in the diverse fields of biology, chemistry, and physics. We show that the sear...
Raúl E. Valdés-Pérez, Jan M. ...
DAGSTUHL
2006
13 years 6 months ago
Using fast matrix multiplication to solve structured linear systems
Structured linear algebra techniques enable one to deal at once with various types of matrices, with features such as Toeplitz-, Hankel-, Vandermonde- or Cauchy-likeness. Following...
Éric Schost, Alin Bostan, Claude-Pierre Jea...
COLING
2008
13 years 6 months ago
Enhancing Multilingual Latent Semantic Analysis with Term Alignment Information
Latent Semantic Analysis (LSA) is based on the Singular Value Decomposition (SVD) of a term-by-document matrix for identifying relationships among terms and documents from cooccur...
Brett W. Bader, Peter A. Chew
COLT
2008
Springer
13 years 6 months ago
Learning Rotations
An algorithm is presented for online learning of rotations. The proposed algorithm involves matrix exponentiated gradient updates and is motivated by the von Neumann divergence. T...
Adam M. Smith, Manfred K. Warmuth
ESA
2006
Springer
118views Algorithms» more  ESA 2006»
13 years 8 months ago
Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods
Much recent work in the theoretical computer science, linear algebra, and machine learning has considered matrix decompositions of the following form: given an m
Petros Drineas, Michael W. Mahoney, S. Muthukrishn...
CVPR
2009
IEEE
13 years 8 months ago
Nonnegative Matrix Factorization with Earth Mover's Distance metric
Nonnegative Matrix Factorization (NMF) approximates a given data matrix as a product of two low rank nonnegative matrices, usually by minimizing the L2 or the KL distance between ...
Roman Sandler, Michael Lindenbaum
ISSAC
1990
Springer
65views Mathematics» more  ISSAC 1990»
13 years 8 months ago
Complexity of Irreducibility Testing for a System of Linear Ordinary Differential Equations
Let a system of linear ordinary differential equations of the first order Y' = AY be given, where A is n x n matrix over a field F(X), assume that the degree degx(A) < d a...
Dima Grigoriev
ICS
1999
Tsinghua U.
13 years 8 months ago
High-level semantic optimization of numerical codes
This paper presents a mathematical framework to exploit the semantic properties of matrix operations in loop-based numerical codes. The heart of this framework is an algebraic lan...
Vijay Menon, Keshav Pingali
NIME
2001
Springer
136views Music» more  NIME 2001»
13 years 9 months ago
The MATRIX: A Novel Controller for Musical Expression
The MATRIX (Multipurpose Array of Tactile Rods for Interactive eXpression) is a new musical interface for amateurs and professionals alike. It gives users a 3dimensional tangible ...
Dan Overholt
EUROPAR
2003
Springer
13 years 9 months ago
Improving Performance of Hypermatrix Cholesky Factorization
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
José R. Herrero, Juan J. Navarro