Sciweavers

364 search results - page 23 / 73
» Dimension Characterizations of Complexity Classes
Sort
View
112
Voted
IEEEICCI
2005
IEEE
15 years 6 months ago
Toward the development of cognitive task difficulty metrics to support intelligence analysis research
Intelligence analysis is a cognitively complex task that is the subject of considerable research aimed at developing methods and tools to aid the analysis process. To support such...
Frank L. Greitzer
87
Voted
IANDC
1998
64views more  IANDC 1998»
15 years 8 days ago
Positive Versions of Polynomial Time
We show that restricting a number of characterizations of the complexity class P to be positive (in natural ways) results in the same class of (monotone) problems which we denote ...
Clemens Lautemann, Thomas Schwentick, Iain A. Stew...
PR
2008
129views more  PR 2008»
15 years 16 days ago
A comparison of generalized linear discriminant analysis algorithms
7 Linear discriminant analysis (LDA) is a dimension reduction method which finds an optimal linear transformation that maximizes the class separability. However, in undersampled p...
Cheong Hee Park, Haesun Park
111
Voted
STOC
1993
ACM
134views Algorithms» more  STOC 1993»
15 years 4 months ago
Quantum complexity theory
In this paper we study quantum computation from a complexity theoretic viewpoint. Our first result is the existence of an efficient universal quantum Turing machine in Deutsch’s...
Ethan Bernstein, Umesh V. Vazirani
COLT
1993
Springer
15 years 4 months ago
Parameterized Learning Complexity
We describe three applications in computational learning theory of techniques and ideas recently introduced in the study of parameterized computational complexity. (1) Using param...
Rodney G. Downey, Patricia A. Evans, Michael R. Fe...