Sciweavers

327 search results - page 14 / 66
» Some Elimination Problems for Matrices
Sort
View
CORR
2008
Springer
126views Education» more  CORR 2008»
13 years 10 months ago
Path following algorithm for the graph matching problem
We propose a convex-concave programming approach for the labeled weighted graph matching problem. The convex-concave programming formulation is obtained by rewriting the weighted ...
Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Ve...
DLOG
2008
14 years 4 days ago
Realization Problem for Formal Concept Analysis
Formal Concept Analysis (FCA) is an approach to knowledge engineering, representation, and analysis. A `standard' FCA-workflow starts with some `experimental' data, class...
Nikolay Shilov
AISC
2006
Springer
14 years 1 months ago
Hierarchical Representations with Signatures for Large Expression Management
Abstract. We describe a method for managing large expressions in symbolic computations which combines a hierarchical representation with signature calculations. As a case study, th...
Wenqin Zhou, Jacques Carette, David J. Jeffrey, Mi...
CORR
2010
Springer
100views Education» more  CORR 2010»
13 years 10 months ago
Fast-Group-Decodable STBCs via Codes over GF(4)
Abstract--In this paper we construct low ML decoding complexity STBCs by using the Pauli matrices as linear dispersion matrices. In this case the Hurwitz-Radon orthogonality condit...
Natarajan Lakshmi Prasad, B. Sundar Rajan
CSR
2007
Springer
14 years 4 months ago
On the Complexity of Matrix Rank and Rigidity
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...
Meena Mahajan, Jayalal M. N. Sarma