Results 1  10
of
588,082
Turing Machines With Few Accepting Computations And Low Sets For PP
, 1992
"... this paper we study two different ways to restrict the power of NP: We consider languages accepted by nondeterministic polynomial time machines with a small number of accepting paths in case of acceptance, and also investigate subclasses of NP that are low for complexity classes not known to be in t ..."
Abstract

Cited by 31 (5 self)
 Add to MetaCart
to be in the polynomial time hierarchy. The first complexity class defined following the idea of bounding the number of accepting paths was Valiant's class UP (unique P) [Va76] of languages accepted by nondeterministic Turing machines that have exactly one accepting computation path for strings in the language
Turing Machines With Few Accepting Computations And Low Sets For PP
"... The intractability of the complexity class NP has motivated the study of subclasses that arise when certain restrictions on the de nition of NP are imposed. For example, the study of sparse sets in NP [Ma82], the study of the probabilistic classes whithin NP ..."
Abstract
 Add to MetaCart
The intractability of the complexity class NP has motivated the study of subclasses that arise when certain restrictions on the de nition of NP are imposed. For example, the study of sparse sets in NP [Ma82], the study of the probabilistic classes whithin NP
Applications of Polynomial and Rational Approximation. . .
, 1992
"... reshold circuits. In Proceedings of the 31st IEEE Symposium on Foundations of Computer Science, pages 619627. IEEE Computer Society Press, 1990. BIBLIOGRAPHY 60 [25] J. Hastad. Almost optimal lower bounds for small depth circuits. In Silvio Micali, editor, Advances in Computing Research 5: Random ..."
Abstract
 Add to MetaCart
: Randomness and Computation, pages 143 170. JAI Press, Greenwich CT, 1989. [26] Johannes Kobler, Uwe Schoning, Seinosuke Toda, and Jacobo Tor'an. Turing machines with few accepting computations and low sets for PP. In Proceedings of the 4th Annual Conference on Structure in Complexity Theory, pages
Sketchpad: A manmachine graphical communication system
, 2003
"... The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical, and ..."
Abstract

Cited by 702 (6 self)
 Add to MetaCart
The Sketchpad system uses drawing as a novel communication medium for a computer. The system contains input, output, and computation programs which enable it to interpret information drawn directly on a computer display. It has been used to draw electrical, mechanical, scientific, mathematical
Machine Learning in Automated Text Categorization
 ACM COMPUTING SURVEYS
, 2002
"... The automated categorization (or classification) of texts into predefined categories has witnessed a booming interest in the last ten years, due to the increased availability of documents in digital form and the ensuing need to organize them. In the research community the dominant approach to this p ..."
Abstract

Cited by 1658 (22 self)
 Add to MetaCart
to this problem is based on machine learning techniques: a general inductive process automatically builds a classifier by learning, from a set of preclassified documents, the characteristics of the categories. The advantages of this approach over the knowledge engineering approach (consisting in the manual
A learning algorithm for Boltzmann machines
 Cognitive Science
, 1985
"... The computotionol power of massively parallel networks of simple processing elements resides in the communication bandwidth provided by the hardware connections between elements. These connections con allow a significant fraction of the knowledge of the system to be applied to an instance of a probl ..."
Abstract

Cited by 586 (13 self)
 Add to MetaCart
problem in o very short time. One kind of computation for which massively porollel networks appear to be well suited is large constraint satisfaction searches, but to use the connections efficiently two conditions must be met: First, a search technique that is suitable for parallel networks must be found
The use of the area under the ROC curve in the evaluation of machine learning algorithms
 Pattern Recognition
, 1997
"... AbstractIn this paper we investigate the use of the area under the receiver operating characteristic (ROC) curve (AUC) as a performance measure for machine learning algorithms. As a case study we evaluate six machine learning algorithms (C4.5, Multiscale Classifier, Perceptron, Multilayer Percept ..."
Abstract

Cited by 664 (3 self)
 Add to MetaCart
AbstractIn this paper we investigate the use of the area under the receiver operating characteristic (ROC) curve (AUC) as a performance measure for machine learning algorithms. As a case study we evaluate six machine learning algorithms (C4.5, Multiscale Classifier, Perceptron, Multi
Training Support Vector Machines: an Application to Face Detection
, 1997
"... We investigate the application of Support Vector Machines (SVMs) in computer vision. SVM is a learning technique developed by V. Vapnik and his team (AT&T Bell Labs.) that can be seen as a new method for training polynomial, neural network, or Radial Basis Functions classifiers. The decision sur ..."
Abstract

Cited by 728 (1 self)
 Add to MetaCart
We investigate the application of Support Vector Machines (SVMs) in computer vision. SVM is a learning technique developed by V. Vapnik and his team (AT&T Bell Labs.) that can be seen as a new method for training polynomial, neural network, or Radial Basis Functions classifiers. The decision
Simulating Physics with Computers
 SIAM Journal on Computing
, 1982
"... A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration. ..."
Abstract

Cited by 601 (1 self)
 Add to MetaCart
A digital computer is generally believed to be an efficient universal computing device; that is, it is believed able to simulate any physical computing device with an increase in computation time of at most a polynomial factor. This may not be true when quantum mechanics is taken into consideration
BLEU: a Method for Automatic Evaluation of Machine Translation
, 2002
"... Human evaluations of machine translation are extensive but expensive. Human evaluations can take months to finish and involve human labor that can not be reused. ..."
Abstract

Cited by 2107 (4 self)
 Add to MetaCart
Human evaluations of machine translation are extensive but expensive. Human evaluations can take months to finish and involve human labor that can not be reused.
Results 1  10
of
588,082