TPDS
1998
13 years 4 months ago
1998
—A matrix A of size m n containing items from a totally ordered universe is termed monotone if, for every i, j, 1 i < j m, the minimum value in row j lies below or to...
IJCV
1998
13 years 4 months ago
1998
Two images of a single scene/object are related by the epipolar geometry, which can be described by a 3x3 singular matrix called the essential matrix if images’ internal paramete...
CORR
1998
Springer
13 years 4 months ago
1998
Springer
Phrase structure trees have a hierarchical structure. In many subjects, most notably in taxonomy such tree structures have been studied using ultrametrics. Here syntactical hierar...
CSDA
2007
13 years 4 months ago
2007
Consider the situation where the Structuration des Tableaux à Trois Indices de la Statistique (STATIS) methodology is applied to a series of studies, each study being represented...
CAGD
2002
13 years 4 months ago
2002
The matrix forms for curves and surfaces were largely promoted in CAD/CAM. In this paper we have presented two matrix representation formulations for arbitrary degree NURBS curves...
APPML
2004
13 years 4 months ago
2004
In this paper, a new condition for the controllability of higher order linear dynamical systems is obtained. The suggested test contains rank conditions of suitably defined matric...
TSP
2008
13 years 4 months ago
2008
We consider the problem of recovering a matrix from its action on a known vector in the setting where the matrix can be represented efficiently in a known matrix dictionary. Conne...
TROB
2008
13 years 4 months ago
2008
We present incremental smoothing and mapping (iSAM), a novel approach to the simultaneous localization and mapping problem that is based on fast incremental matrix factorization. i...
PR
2008
13 years 5 months ago
2008
The spectrum of a graph has been widely used in graph theory to characterise the properties of a graph and extract information from its structure. It has also been employed as a g...
PC
2008
13 years 5 months ago
2008
We present a graph partitioning algorithm that aims at partitioning a sparse matrix into a block-diagonal form, such that any two consecutive blocks overlap. We denote this form o...