Sciweavers

8669 search results - page 11 / 1734
» Computing matrix representations
Sort
View
DAM
2006
81views more  DAM 2006»
13 years 7 months ago
Equivalence-free exhaustive generation of matroid representations
Abstract. In this paper we present an algorithm for the problem of exhaustive equivalence-free generation of 3-connected matroids which are represented by a matrix over some finite...
Petr Hlinený
CORR
2004
Springer
117views Education» more  CORR 2004»
13 years 7 months ago
Efficient dot product over word-size finite fields
We want to achieve efficiency for the exact computation of the dot product of two vectors over word size finite fields. We therefore compare the practical behaviors of a wide range...
Jean-Guillaume Dumas
IMC
2004
ACM
14 years 1 months ago
Modeling distances in large-scale networks by matrix factorization
In this paper, we propose a model for representing and predicting distances in large-scale networks by matrix factorization. The model is useful for network distance sensitive app...
Yun Mao, Lawrence K. Saul
ICPR
2008
IEEE
14 years 2 months ago
Incremental clustering via nonnegative matrix factorization
Nonnegative matrix factorization (NMF) has been shown to be an efficient clustering tool. However, NMF`s batch nature necessitates recomputation of whole basis set for new samples...
Serhat Selcuk Bucak, Bilge Günsel
SMILE
1998
Springer
13 years 11 months ago
Tensor Embedding of the Fundamental Matrix
We revisit the bilinear matching constraint between two perspective views of a 3D scene. Our objective is to represent the constraint in the same manner and form as the trilinear ...
Shai Avidan, Amnon Shashua