The efficiency of algorithms and machines: a survey of the complexity theoretic approach
Abstract
- The efficiency of algorithms and machines: a survey of the complexity theoretic approach
Recommendations
Feasible Time-Optimal Algorithms for Boolean Functions on Exclusive-Write Parallel Random-Access machines
It was shown some years ago that the computation time for many important Boolean functions of $n$ arguments on concurrent-read exclusive-write parallel random-access machines (CREW PRAMs) of unlimited size is at least $arphi (n) \approx 0.72\log_...
Wavelet twin support vector machines based on glowworm swarm optimization
Twin support vector machine is a machine learning algorithm developing from standard support vector machine. The performance of twin support vector machine is always better than support vector machine on datasets that have cross regions. Recently ...
PAC-Bayes bounds for twin support vector machines
Twin support vector machines are regarded as a milestone in the development of support vector machines. Compared to standard support vector machines, they learn two nonparallel hyperplanes rather than one as in standard support vector machines for ...
Comments
Information & Contributors
Information
Published In
Sponsors
- AFIPS: American Federation of Information Processing Societies
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0