Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,356,138 papers from all fields of science
Search
Sign In
Create Free Account
Characteristic function (convex analysis)
Known as:
Characteristic function
In the field of mathematics known as convex analysis, the characteristic function of a set is a convex function that indicates the membership (or non…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Bipolar theorem
Convex function
Convex optimization
Duality (optimization)
Expand
Broader (1)
Convex analysis
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2012
Highly Cited
2012
A Cooperative Communication Scheme Based on Coalition Formation Game in Clustered Wireless Sensor Networks
Dan Wu
,
Yueming Cai
,
Liang Zhou
,
Jinlong Wang
IEEE Transactions on Wireless Communications
2012
Corpus ID: 4859026
In this work, we study the problem of how to strike a balance between the QoS provisioning and the energy efficiency when a…
Expand
2011
2011
On Maximum Eigenmode Beamforming and Multi-User Gain
Peng Wang
,
L. Ping
IEEE Transactions on Information Theory
2011
Corpus ID: 3544436
This paper is concerned with the advantages of multi-user concurrent transmission in multiple-input multiple-output (MIMO…
Expand
Highly Cited
2007
Highly Cited
2007
Opportunistic Feedback for Multiuser MIMO Systems With Linear Receivers
Taiwen Tang
,
R. Heath
,
Sunghyun Cho
,
Sangboh Yun
IEEE Transactions on Communications
2007
Corpus ID: 13504815
A novel multiuser scheduling and feedback strategy for the multiple-input multiple-output (MIMO) downlink is proposed in this…
Expand
Highly Cited
2004
Highly Cited
2004
Investigation of a 2R all-optical regenerator based on four-wave mixing in a semiconductor optical amplifier
H. Simos
,
A. Bogris
,
D. Syvridis
Journal of Lightwave Technology
2004
Corpus ID: 20620995
The properties of an all-optical 2R regenerator based on four-wave mixing (FWM) in a semiconductor optical amplifier (SOA) are…
Expand
Highly Cited
2003
Highly Cited
2003
Optimal Foldover Plans for Two-Level Nonregular Orthogonal Designs
William Li
,
D. Lin
,
Kenny Q. Ye
Technometrics
2003
Corpus ID: 736669
This article considers optimal foldover plans for nonregular designs. By using the indicator function, we define words with…
Expand
Highly Cited
2002
Highly Cited
2002
A new view of performance analysis of transmit diversity schemes in correlated Rayleigh fading
S. Siwamogsatham
,
M. Fitz
,
J. Grimm
IEEE Transactions on Information Theory
2002
Corpus ID: 11033161
This article provides a new formulation for the pairwise error probability for any coherently demodulated system in arbitrarily…
Expand
Highly Cited
1998
Highly Cited
1998
A generalized QS-CDMA system and the design of new spreading codes
B. Long
,
Ping Zhang
,
Jiandong Hu
1998
Corpus ID: 61248522
A generalized quasi-synchronous code-division multiple-access (QS-CDMA) system for digital mobile radio communications is…
Expand
Highly Cited
1994
Highly Cited
1994
Multiuser detection for optical code division multiple access systems
M. Brandt-Pearce
,
B. Aazhang
IEEE Transactions on Communications
1994
Corpus ID: 38699505
Considers a multiuser detection scheme for optical direct sequence code division multiple access (OCDMA) systems, referred to as…
Expand
Highly Cited
1986
Highly Cited
1986
Absence of localization in a class of Schrödinger operators with quasiperiodic potential
F. Delyon
,
D. Petritis
1986
Corpus ID: 124037735
We prove that a class of discrete Schrödinger operators with a quasiperiodic potential taking only a finite number of values…
Expand
Highly Cited
1973
Highly Cited
1973
Minimization of Multidimensional Linear Iterative Circuits
D. D. Givone
,
R. Roesser
IEEE transactions on computers
1973
Corpus ID: 1287613
A model for two-dimensional linear iterative circuits is defined in the form of matrix equations. From the matrix equations, a…
Expand
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