Conferences related to Upper bound

Back to Top

ICC 2021 - IEEE International Conference on Communications

IEEE ICC is one of the two flagship IEEE conferences in the field of communications; Montreal is to host this conference in 2021. Each annual IEEE ICC conference typically attracts approximately 1,500-2,000 attendees, and will present over 1,000 research works over its duration. As well as being an opportunity to share pioneering research ideas and developments, the conference is also an excellent networking and publicity event, giving the opportunity for businesses and clients to link together, and presenting the scope for companies to publicize themselves and their products among the leaders of communications industries from all over the world.


2020 59th IEEE Conference on Decision and Control (CDC)

The CDC is the premier conference dedicated to the advancement of the theory and practice of systems and control. The CDC annually brings together an international community of researchers and practitioners in the field of automatic control to discuss new research results, perspectives on future developments, and innovative applications relevant to decision making, automatic control, and related areas.


GLOBECOM 2020 - 2020 IEEE Global Communications Conference

IEEE Global Communications Conference (GLOBECOM) is one of the IEEE Communications Society’s two flagship conferences dedicated to driving innovation in nearly every aspect of communications. Each year, more than 2,900 scientific researchers and their management submit proposals for program sessions to be held at the annual conference. After extensive peer review, the best of the proposals are selected for the conference program, which includes technical papers, tutorials, workshops and industry sessions designed specifically to advance technologies, systems and infrastructure that are continuing to reshape the world and provide all users with access to an unprecedented spectrum of high-speed, seamless and cost-effective global telecommunications services.


ICASSP 2020 - 2020 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)

The ICASSP meeting is the world's largest and most comprehensive technical conference focused on signal processing and its applications. The conference will feature world-class speakers, tutorials, exhibits, and over 50 lecture and poster sessions.


IEEE INFOCOM 2020 - IEEE Conference on Computer Communications

IEEE INFOCOM solicits research papers describing significant and innovative researchcontributions to the field of computer and data communication networks. We invite submissionson a wide range of research topics, spanning both theoretical and systems research.


More Conferences

Periodicals related to Upper bound

Back to Top

Antennas and Propagation, IEEE Transactions on

Experimental and theoretical advances in antennas including design and development, and in the propagation of electromagnetic waves including scattering, diffraction and interaction with continuous media; and applications pertinent to antennas and propagation, such as remote sensing, applied optics, and millimeter and submillimeter wave techniques.


Audio, Speech, and Language Processing, IEEE Transactions on

Speech analysis, synthesis, coding speech recognition, speaker recognition, language modeling, speech production and perception, speech enhancement. In audio, transducers, room acoustics, active sound control, human audition, analysis/synthesis/coding of music, and consumer audio. (8) (IEEE Guide for Authors) The scope for the proposed transactions includes SPEECH PROCESSING - Transmission and storage of Speech signals; speech coding; speech enhancement and noise reduction; ...


Automatic Control, IEEE Transactions on

The theory, design and application of Control Systems. It shall encompass components, and the integration of these components, as are necessary for the construction of such systems. The word `systems' as used herein shall be interpreted to include physical, biological, organizational and other entities and combinations thereof, which can be represented through a mathematical symbolism. The Field of Interest: shall ...


Communications Letters, IEEE

Covers topics in the scope of IEEE Transactions on Communications but in the form of very brief publication (maximum of 6column lengths, including all diagrams and tables.)


Communications, IEEE Transactions on

Telephone, telegraphy, facsimile, and point-to-point television, by electromagnetic propagation, including radio; wire; aerial, underground, coaxial, and submarine cables; waveguides, communication satellites, and lasers; in marine, aeronautical, space and fixed station services; repeaters, radio relaying, signal storage, and regeneration; telecommunication error detection and correction; multiplexing and carrier techniques; communication switching systems; data communications; and communication theory. In addition to the above, ...


More Periodicals

Most published Xplore authors for Upper bound

Back to Top

Xplore Articles related to Upper bound

Back to Top

Session: pattern recognition

1988 IEEE International Symposium on Information Theory., 1988

The following topics are dealt with: directed divergence characterisation; rotation-invariant image classifiers; error rate smoothing; feature ordering and stopping rules.<<ETX>>


Multiple error correction by means of parity checks

IRE Transactions on Information Theory, 1958

An n-place binary parity check code which corrects up to and including e errors in each code letter is fully described by its n characteristics, which are r-dimensional vectors, where r is the number of redundant binits in each code letter. It is shown that the characteristics of such a code have the essential property that any subset of 2e ...


Mobile radio signal correlation versus antenna height and spacing

26th IEEE Vehicular Technology Conference, 1976

None


Signal Enhancement as Minimization of Relevant Information Loss

SCC 2013; 9th International ITG Conference on Systems, Communication and Coding, 2013

We introduce the notion of relevant information loss for the purpose of casting the signal enhancement problem in information-theoretic terms. We show that many algorithms from machine learning can be reformulated using relevant information loss, which allows their application to the aforementioned problem. As a particular example we analyze principle component analysis for dimensionality reduction, discuss its optimality, and show ...


Extended Mappings for Wireless Network Coded Butterfly Network

17th European Wireless 2011 - Sustainable Wireless Technologies, 2011

We consider the application of wireless network coding to a "butterfly" wireless network, comprising two sources and two destinations sharing a single relay. We obtain upper bounds on the end to end capacity of the network in terms of the codebook cardinalities, allowing the use of an extended rather than a minimal hierarchical mapping at the relay and assuming that ...


More Xplore Articles

Educational Resources on Upper bound

Back to Top

IEEE-USA E-Books

  • Session: pattern recognition

    The following topics are dealt with: directed divergence characterisation; rotation-invariant image classifiers; error rate smoothing; feature ordering and stopping rules.<<ETX>>

  • Multiple error correction by means of parity checks

    An n-place binary parity check code which corrects up to and including e errors in each code letter is fully described by its n characteristics, which are r-dimensional vectors, where r is the number of redundant binits in each code letter. It is shown that the characteristics of such a code have the essential property that any subset of 2e of them are linearly independent. An upper bound on r for fixed n and e is obtained by consideration of a systematic procedure for finding the characteristics; this upper bound is always less than, or equal to, twice the lower bound of Hamming.<sup>1</sup>

  • Mobile radio signal correlation versus antenna height and spacing

    None

  • Signal Enhancement as Minimization of Relevant Information Loss

    We introduce the notion of relevant information loss for the purpose of casting the signal enhancement problem in information-theoretic terms. We show that many algorithms from machine learning can be reformulated using relevant information loss, which allows their application to the aforementioned problem. As a particular example we analyze principle component analysis for dimensionality reduction, discuss its optimality, and show that the relevant information loss can indeed vanish if the relevant information is concentrated on a lower-dimensional subspace of the input space.

  • Extended Mappings for Wireless Network Coded Butterfly Network

    We consider the application of wireless network coding to a "butterfly" wireless network, comprising two sources and two destinations sharing a single relay. We obtain upper bounds on the end to end capacity of the network in terms of the codebook cardinalities, allowing the use of an extended rather than a minimal hierarchical mapping at the relay and assuming that partial complementary side information is available at each destination directly from its complementary source. We further show that this bound may be achieved using a linear mapping at the relay. We obtain numerical results for the mutual information on the links of the network, and hence show that the extended mapping may provide increased capacity compared to the minimal for some values of channel fading parameters.

  • Upper bounds of wavelets on 2-D lipschitz class and zerotrees

    The wavelet transform method has become one of the most powerful tools in image compression applications. It has a number of advantages with respect to other spectral transforms. With lossy compression, after a suitable wavelet transform is chosen two basic procedures — zonal and threshold coding — are usually applied to the spectral image [1]. In zonal coding only a fixed small "zone" of transformed image is encoded and the optimal zonal coding method ensures the best selection of spectral zones at which a minimum mean-square error of reconstruction is achieved. In order to determine optimal zonal coding method for the chosen transform one has to obtain the estimates of its spectra on a given class of input images. We suggest in this paper a unified approach to obtain exact upper bounds of a given wavelet transform on the class of discrete images with bounded first order finite differences. The presented estimates allow to apriori identify the spectral "zones" that are likely to be of significance in image reconstruction for a given wavelet transform.

  • On Fragmentation for Fountain Codes

    We study the performance of selected communication schemes based on fountain codes, under maximum-likelihood (ML) decoding, as a function of the Protocol Data Unit (PDU) erasure probability. In particular, we also consider a scheme that reduces the performance loss due to fragmentation of fountain coding symbols into several PDUs. For the presented schemes, tight upper bounds on the failure probabilities are derived and finite length decoding complexity analysis are provided. Furthermore, we propose an enhanced decoding technique for one of the selected schemes.

  • On the determination of the optimal center and scale factor for truncated Hermite series

    Signals that are fairly concentrated in time or space can often be conveniently described by a truncated Hermite series. The rate of convergence of such series depends on the center and scale factor of the Hermite functions. In this paper we present some results concerning the determination of the optimal values of these two important parameters. We address the problem of the approximation of one-dimensional functions defined in the continuous interval (−∞,∞).

  • Session: linear complexity

    The following topics are dealt with: self-decimated sequences; arbitrary finite field sequences; and jump complexity.<<ETX>>

  • Indexing evolving events from tweet streams

    Tweet streams provide a variety of real-time information on dynamic social events. Although event detection has been actively studied, most of the existing approaches do not address the issue of efficient event monitoring in the presence of a large number of events detected from continuous tweet streams. In this paper, we capture the dynamics of events using four event operations: creation, absorption, split and merge.We also propose a novel event indexing structure, named Multi-layer Inverted List (MIL), for the acceleration of large-scale event search and update. We thoroughly study the problem of nearest neighbour search using MIL based on upper bound pruning. Extensive experiments have been conducted on a large-scale tweet dataset. The results demonstrate the promising performance of our method in terms of both efficiency and effectiveness.



Standards related to Upper bound

Back to Top

(Replaced) IEEE Standard VHDL Language Reference Manual

his standard revises and enhances the VHDL language reference manual (LRM) by including a standard C language interface specification; specifications from previously separate, but related, standards IEEE Std 1164 -1993,1 IEEE Std 1076.2 -1996, and IEEE Std 1076.3-1997; and general language enhancements in the areas of design and verification of electronic systems.



Jobs related to Upper bound

Back to Top