Academic
Keywords
Computational Complexity
Computational Complexity
Publications: 31,160| Citation Count: 260,154
Stemming Variations: computational complexities, computational complex, Computing complex, computation complexity, compute complex
Cumulative Annual
    • Computational complexity is an important performance constraint for software-only video CODECs. The aim of this research is to develop a video coding system with variable, controllable computational complexity...

    Yafan Zhaoet al. Complexity management for video encoders

    • Computational complexity is a major concern for practical use of the versatile particle filter (PF) for nonlinear filtering applications. Previous work to mitigate the inherent complexity includes the marginalized particle filter (MPF), with the fastSLAM algorithm as one important case. MPF utilizes a linear Gaussian sub-structure in the problem, where the Kalman filter (KF) can be applied. While this reduces the state dimension in the PF, the present work aims at reducing the sampling rate of the PF...

    Thomas B. Schet al. FAST PARTICLE FILTERS FOR MULTI-RATE SENSORS

    • Computational complexity is the subfield of computer science that rigorously studies the intrinsic difficulty of computational problems. This survey explains how complexity theory defines “hard problems”; applies these concepts to several equilibrium computation problems; and discusses implications for computation, games, and behavior...

    Tim Roughgarden. Computing equilibria: a computational complexity perspective

Order by: