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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Review
2016
Review
2016
Simultaneous localization and mapping (SLAM) consists in the concurrent construction of a model of the environment (the map), and… (More)
  • figure 1
  • table I
  • figure 2
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2014
Highly Cited
2014
We marry ideas from deep neural networks and approximate Bayesian inference to derive a generalised class of deep, directed… (More)
  • figure 1
  • figure 2
  • table 1
  • figure 3
  • figure 4
Is this relevant?
Highly Cited
2011
Highly Cited
2011
Cellular networks are usually modeled by placing the base stations on a grid, with mobile users either randomly scattered or… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2010
Highly Cited
2010
We explore an original strategy for building deep networks, based on stacking layers of denoising autoencoderswhich are trained… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We propose a new family of description logics (DLs), called DL-Lite, specifically tailored to capture basic ontology languages… (More)
  • figure 4
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Most current statistical natural language processing models use only local features so as to permit dynamic programming in… (More)
  • figure 1
  • table 2
  • table 1
  • table 3
  • table 4
Is this relevant?
Highly Cited
2004
Highly Cited
2004
A robust approach to solving linear optimization problems with uncertain data was proposed in the early 1970s and has recently… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 1
  • figure 4
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We suggest a means of obtaining certain Green’s functions in 3+1-dimensional N = 4 supersymmetric Yang-Mills theory with a large… (More)
Is this relevant?
Highly Cited
1998
Highly Cited
1998
We present a pattern-mining algorithm that scales roughly linearly in the number of maximal patterns embedded in a database… (More)
  • figure 1
  • table 1
  • figure 13
  • figure 9
  • figure 14
Is this relevant?
Highly Cited
1992
Highly Cited
1992
We present the a-calculus, a calculus of communicating systems in which one can naturally express processes which have changing… (More)
  • figure 1
  • figure 2
  • figure 3
Is this relevant?