7988 search results - page 1551 / 1598 » A Useful Undecidable Theory |
STOC
2010
ACM
14 years 28 days ago
2010
ACM
The spectral profile of a graph is a natural generalization of the classical notion of its Rayleigh quotient. Roughly speaking, given a graph G, for each 0 < < 1, the spect...
COLT
1993
Springer
14 years 28 days ago
1993
Springer
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
COLT
1993
Springer
14 years 28 days ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
IFIP
1994
Springer
14 years 28 days ago
1994
Springer
The concept of information landscapes has been a constant theme in the development of interactive multimedia packages. For the interface and access to this information to be effec...
PODS
1994
ACM
14 years 27 days ago
1994
ACM
Traditionally, computational complexity has considered only static problems. Classical Complexity Classes such as NC, P, and NP are de ned in terms of the complexity of checking {...