Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 218,250,724 papers from all fields of science
Search
Sign In
Create Free Account
Unimodular polynomial matrix
Known as:
Unimodular
In mathematics, a unimodular polynomial matrix is a square polynomial matrix whose inverse exists and is itself a polynomial matrix. Equivalently, a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
1 relation
Polynomial matrix
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2016
Highly Cited
2016
Efficient algorithm for k-barrier coverage based on integer linear programming
Yanhua Zhang
,
Xingming Sun
,
Baowei Wang
China Communications
2016
Corpus ID: 35453196
Barrier coverage of wireless sensor networks is an important issue in the detection of intruders who are attempting to cross a…
Expand
Review
2014
Review
2014
Existence of unimodular triangulations — positive results
Christian Haase
,
Andreas Paffenholz
,
Lindsay C. Piechnik
,
F. Santos
2014
Corpus ID: 119674853
Unimodular triangulations of lattice polytopes arise in algebraic geometry, commutative algebra, integer programming and, of…
Expand
Highly Cited
2013
Highly Cited
2013
Designing Unimodular Codes Via Quadratic Optimization
M. Soltanalian
,
P. Stoica
IEEE Transactions on Signal Processing
2013
Corpus ID: 1035412
The NP-hard problem of optimizing a quadratic form over the unimodular vector set arises in radar code design scenarios as well…
Expand
Highly Cited
2012
Highly Cited
2012
The transfer matrix: A geometrical perspective
L. Sánchez‐Soto
,
J. Monzón
,
A. Barriuso
,
J. Cariñena
2012
Corpus ID: 118463172
Highly Cited
2010
Highly Cited
2010
Waveform design with stopband and correlation constraints for cognitive radar
Hao He
,
P. Stoica
,
Jian Li
International Workshop on Cognitive Information…
2010
Corpus ID: 13030574
One of the main objectives of cognitive radar is to adapt the spectrum of transmit waveforms to certain needs, such as avoiding…
Expand
Highly Cited
2000
Highly Cited
2000
Probe Backtrack Search for Minimal Perturbation in Dynamic Scheduling
Hani El Sakkout
,
M. Wallace
Constraints
2000
Corpus ID: 9593789
This paperdescribes an algorithm designed to minimally reconfigure schedulesin response to a changing environment. External…
Expand
Highly Cited
1998
Highly Cited
1998
An Explicit Formula for Local Densities of Quadratic Forms
Tonghai Yang
1998
Corpus ID: 15892538
Let S and T be two positive definite integral matrices of rank m and n respectively. It is an ancient but still very challenging…
Expand
Highly Cited
1997
Highly Cited
1997
Type II codes over Z4
A. Bonnecaze
,
P. Solé
,
C. Bachoc
,
B. Mourrain
IEEE Transactions on Information Theory
1997
Corpus ID: 41151563
The conditions satisfied by the weight enumerator of self-dual codes, defined over the ring of integers module four, have been…
Expand
Highly Cited
1983
Highly Cited
1983
Shortest chain subject to side constraints
Y. Aneja
,
V. Aggarwal
,
K. Nair
Networks
1983
Corpus ID: 11487012
Certain properties of a shortest chain subject to several side constraints are established. Based on these an implicit…
Expand
Highly Cited
1981
Highly Cited
1981
Invariants and canonical forms for systems structural and parametric identification
R. Guidorzi
at - Automatisierungstechnik
1981
Corpus ID: 33807278
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE