Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Cobham's thesis

Known as: Tractable, Cobham–Edmonds thesis, Cobham-Edmonds thesis 
Cobham's thesis, also known as Cobham–Edmonds thesis (named after Alan Cobham and Jack Edmonds), asserts that computational problems can be feasibly… Expand
Wikipedia

Related topics

Related topics

9 relations
Analysis of algorithmsComplexity classComputational complexity theoryJack Edmonds
Expand

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2020
Review
2020
Toward Massive MIMO 2.0: Understanding Spatial Correlation, Interference Suppression, and Pilot Contamination
Since the seminal paper by Marzetta from 2010, Massive MIMO has changed from being a theoretical concept with an infinite number… Expand
  • figure 1
  • figure 2
  • table I
  • figure 3
  • figure 4
Review
2019
Review
2019
A survey of adjustable robust optimization
Static robust optimization (RO) is a methodology to solve mathematical optimization problems with uncertain data. The objective… Expand
Review
2019
Review
2019
A Tutorial on UAVs for Wireless Networks: Applications, Challenges, and Open Problems
The use of flying platforms such as unmanned aerial vehicles (UAVs), popularly known as drones, is rapidly growing. In particular… Expand
  • table I
  • table II
  • figure 1
  • figure 2
  • table IV
Review
2018
Review
2018
Governance Solutions to the Tragedy of the Commons That Marine Plastics Have Become
Plastic pollution has become the new millennium's tragedy of the commons. This is particularly true with the marine debris… Expand
Review
2017
Review
2017
Age of Information: A New Concept, Metric, and Tool
In an increasingly networked world in which information is becoming increasingly actual, how can a system know with certainty… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 3.2
Highly Cited
2014
Highly Cited
2014
Stochastic Backpropagation and Approximate Inference in Deep Generative Models
We marry ideas from deep neural networks and approximate Bayesian inference to derive a generalised class of deep, directed… Expand
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Highly Cited
2012
Highly Cited
2012
Practical Bayesian Optimization of Machine Learning Algorithms
The use of machine learning algorithms frequently involves careful tuning of learning parameters and model hyperparameters… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2010
Highly Cited
2010
Stacked Denoising Autoencoders: Learning Useful Representations in a Deep Network with a Local Denoising Criterion
We explore an original strategy for building deep networks, based on stacking layers of denoising autoencoders which are trained… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Highly Cited
2004
Highly Cited
2004
The Nature of the Firm
ECONOMIC theory has suffered in the past from a failure to state clearly its assumptions. Economists in building up a theory have… Expand
Highly Cited
1996
Highly Cited
1996
BIRCH: an efficient data clustering method for very large databases
Finding useful patterns in large datasets has attracted considerable interest recently, and one of the most widely studied… Expand
  • figure 1
  • figure 3
  • table 1
  • table 2
  • table 5
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy, Terms of Service, and Dataset License
ACCEPT & CONTINUE