Blum axioms

Known as: Blum, Blum complexity axioms, Complexity measure 
In computational complexity theory the Blum axioms or Blum complexity axioms are axioms that specify desirable properties of complexity measures on… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2007
Highly Cited
2007
The capabilities of a firm, or any organization, lie primarily in the organizing principles by which individual and functional… (More)
  • table 1
  • table 3
  • table 2
  • table 4
  • table 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
This paper considers the problem of simultaneous multiuser downlink beamforming. The idea is to employ a transmit antenna array… (More)
  • figure 1
  • figure 2
  • figure 5
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Algorithms for tracking concept drift are important for many applications. We present a general method based on the Weighted… (More)
  • figure 2
  • figure 3
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
2000
Highly Cited
2000
[PDF] [Full Text] [Abstract] , June 1, 2006; 8 (6): 398-402. Europace V. Tuzcu, S. Nas, T. Borklu and A. Ugur Decrease in the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2000
Highly Cited
2000
We examine in some detail Mel Frequency Cepstral Coefficients (MFCCs) the dominant features used for speech recognition and… (More)
Is this relevant?
Highly Cited
2000
Highly Cited
2000
In many practical learning scenarios, there is a small amount of labeled data along with a large pool of unlabeled data. Many… (More)
  • figure 1
Is this relevant?
Highly Cited
1999
Highly Cited
1999
This paper discusses the use of unlabeled examples for the problem of named entity classification. A large number of rules is… (More)
  • table 1
  • table 2
  • figure 3
Is this relevant?
Highly Cited
1987
Highly Cited
1987
Information-based complexity seeks to develop general results about the intrinsic difficulty of solving problems where available… (More)
Is this relevant?
Highly Cited
1978
Highly Cited
1978
We present here an application of symmetric axis geometry to shape classification and description. Shapes are segmented into… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1977
Highly Cited
1977
1. Introduction The study of expected running time of algoritruns is an interesting subject from both a theoretical and a… (More)
Is this relevant?