Results 1  10
of
152,241
Nonintrusive speech quality assessment with low computational complexity
 In Interspeech  ICSLP
, 2006
"... We describe an algorithm for monitoring subjective speech quality without access to the original signal that has very low computational and memory requirements. The features used in the proposed algorithm can be computed from commonly used speechcoding parameters. Reconstruction and perceptual trans ..."
Abstract

Cited by 2 (1 self)
 Add to MetaCart
We describe an algorithm for monitoring subjective speech quality without access to the original signal that has very low computational and memory requirements. The features used in the proposed algorithm can be computed from commonly used speechcoding parameters. Reconstruction and perceptual
Schemes for Digital Gift Certificates with Low Computation Complexity
, 2003
"... Abstract. Recently, ecommerce becomes widespread; hence electronic department stores come into being. As a result, Chan and Chang proposed a scheme for digital gift certificates in 2002. Because it is hard to estimate the number of the clients of the electronic department stores, reducing the compu ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
the computation complexity of the electronic department stores becomes an important issue. Due to the need, we propose two schemes for digital gift certificates. Our proposed schemes are very practical since the computation load is light. So the schemes can be applied to the terminals with low computation power
1Frequency Domain GSC with Low Computational Complexity
"... Abstract  The frequency domain generalized sidelobe canceller(FLMSGSC) removes the interference signals rapidly by using the frequency domain least mean square (FLMS) algorithm. However,it, requires a lot of computational complexity. In this paper, a new realization of the frequency domain GSC, c ..."
Abstract
 Add to MetaCart
Abstract  The frequency domain generalized sidelobe canceller(FLMSGSC) removes the interference signals rapidly by using the frequency domain least mean square (FLMS) algorithm. However,it, requires a lot of computational complexity. In this paper, a new realization of the frequency domain GSC
Frequency Offset Estimator with Low Computational Complexity
"... Abstract — This paper addresses a low complexity frequency offset estimator for multipleinput multipleoutput (MIMO) orthogonal frequency division multiplexing (OFDM) systems over frequency selective fading channels. By exploiting the good correlation property of the training sequences, which are c ..."
Abstract
 Add to MetaCart
Abstract — This paper addresses a low complexity frequency offset estimator for multipleinput multipleoutput (MIMO) orthogonal frequency division multiplexing (OFDM) systems over frequency selective fading channels. By exploiting the good correlation property of the training sequences, which
Some relations between classes of low computational complexity
 Bulletin of London Mathematical Society
, 1984
"... In 1978 I believed that I had established the results of this paper; in 1980 I tried unsuccessfully to recover the certainly uncouth, possibly fallacious proofs so that they could be included in the Festschrift for Professor Specker's 60th birthday. The reasonably concise proof given here is ne ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
In 1978 I believed that I had established the results of this paper; in 1980 I tried unsuccessfully to recover the certainly uncouth, possibly fallacious proofs so that they could be included in the Festschrift for Professor Specker's 60th birthday. The reasonably concise proof given here is new. 1. Preliminaries We say that a function F: f ^ m> N is 0bounded if there is a number a such that F(xlt...,xJ < a + Max{xl5...,xm}. F is 1bounded if there are numbers a, b such that Max {*!,..., xm}> b => F(xlt...,xm) < a. Max{xl5..., xm}. It is 2bounded if there are numbers b, r such that Max{xl5...,xm}> b => F(xlt...,xm) < (Max{xl5..., xm}) r. Evidently F is 1bounded (respectively 2bounded) if F(x1,..., xm) is bounded for all x1,...,xm by a linear (respectively a polynomial) function of Max{xl5..., xm}. We shall prove that if a 0bounded function can be defined using 2bounded primitive recursion it can also be defined using simultaneous 0bounded recursions. By a class %> of numbertheoretic functions we shall always mean a collection which contains the successor function, the case function C {Cxyuv = x if u = v, Cxyuv = y\fu^v) and which is closed under explicit definition. #„. denotes the set of relations whose characteristic functions are in ( 6. In [2] Grzegorczyk introduced the hierarchy S n of primitive recursive functions. For n = 0,1, 2, S n is, roughly speaking, the smallest class closed under nbounded recursion. This statement becomes exact if we enlarge S ° to the class S o+ by adding Max {xj, x2} as an initial function. It is an idiosyncracy of Grzegorczyk's definition that Max ^ 0; thus S ° is not a class. But S ° and S ' o+ contain the same relations:
Computer Vision
, 1982
"... Driver inattention is one of the main causes of traffic accidents. Monitoring a driver to detect inattention is a complex problem that involves physiological and behavioral elements. Different approaches have been made, and among them Computer Vision has the potential of monitoring the person behind ..."
Abstract

Cited by 1041 (11 self)
 Add to MetaCart
Driver inattention is one of the main causes of traffic accidents. Monitoring a driver to detect inattention is a complex problem that involves physiological and behavioral elements. Different approaches have been made, and among them Computer Vision has the potential of monitoring the person
LowDensity ParityCheck Codes
, 1963
"... Preface The Noisy Channel Coding Theorem discovered by C. E. Shannon in 1948 offered communication engineers the possibility of reducing error rates on noisy channels to negligible levels without sacrificing data rates. The primary obstacle to the practical use of this theorem has been the equipment ..."
Abstract

Cited by 1366 (1 self)
 Add to MetaCart
the equipment complexity and the computation time required to decode the noisy received data.
Coupled hidden Markov models for complex action recognition
, 1996
"... We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying twohanded actions. HMMs are perhaps the most successful framework in perceptual computing for modeling and ..."
Abstract

Cited by 501 (22 self)
 Add to MetaCart
We present algorithms for coupling and training hidden Markov models (HMMs) to model interacting processes, and demonstrate their superiority to conventional HMMs in a vision task classifying twohanded actions. HMMs are perhaps the most successful framework in perceptual computing for modeling
Parameterized Complexity
, 1998
"... the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs ..."
Abstract

Cited by 1213 (77 self)
 Add to MetaCart
the rapidly developing systematic connections between FPT and useful heuristic algorithms  a new and exciting bridge between the theory of computing and computing in practice. The organizers of the seminar strongly believe that knowledge of parameterized complexity techniques and results belongs
Monotone Complexity
, 1990
"... We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a simple ..."
Abstract

Cited by 2825 (11 self)
 Add to MetaCart
We give a general complexity classification scheme for monotone computation, including monotone spacebounded and Turing machine models not previously considered. We propose monotone complexity classes including mAC i , mNC i , mLOGCFL, mBWBP , mL, mNL, mP , mBPP and mNP . We define a
Results 1  10
of
152,241