NA
2006
13 years 4 months ago
2006
When constructing multivariate Pad
MP
2006
13 years 4 months ago
2006
A 0/
MP
2006
13 years 4 months ago
2006
Although the general linear complementarity problem (LCP) is NP-complete, there are special classes that can be solved in polynomial time. One example is the type where the definin...
ML
2006
ACM
13 years 4 months ago
2006
ACM
This paper addresses the problem of transductive learning of the kernel matrix from a probabilistic perspective. We define the kernel matrix as a Wishart process prior and construc...
CORR
2007
Springer
13 years 4 months ago
2007
Springer
A bimatrix game (A, B) is called a game of rank k if the rank of the matrix A + B is at most k. We consider the problem of enumerating the Nash equilibria in
CORR
2007
Springer
13 years 4 months ago
2007
Springer
Many data analysis applications deal with large matrices and involve approximating the matrix using a small number of “components.” Typically, these components are linear combi...
IJSM
2006
13 years 4 months ago
2006
In a previous work [1] we introduced a construction designed to produce biorthogonal multiresolutions from given subdivisions. This construction was formulated in matrix terms, wh...
COMBINATORICS
2007
13 years 4 months ago
2007
Each m by m symmetric matrix M over 0, 1, ∗, defines a partition problem, in which an input graph G is to be partitioned into m parts with adjacencies governed by M, in the sen...
COMBINATORICS
2007
13 years 4 months ago
2007
We consider the finite binary words Z(n), n ∈ N, defined by the following selfsimilar process: Z(0) := 0, Z(1) := 01, and Z(n + 1) := Z(n) · Z(n − 1), where the dot · deno...
DAM
2006
13 years 4 months ago
2006
We show that the adjacency matrix M of the line digraph of a d-regular digraph D on n vertices can be written as M = AB, where the matrix A is the Kronecker product of the all-one...