Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (4407)
- TÜBİTAK (1233)
- Purdue University (1089)
- Old Dominion University (945)
- Missouri University of Science and Technology (916)
-
- University of Nebraska - Lincoln (870)
- Air Force Institute of Technology (846)
- Wright State University (817)
- San Jose State University (616)
- Dartmouth College (581)
- Edith Cowan University (567)
- Brigham Young University (506)
- California Polytechnic State University, San Luis Obispo (448)
- City University of New York (CUNY) (444)
- University of Texas at El Paso (387)
- Technological University Dublin (367)
- Portland State University (354)
- New Jersey Institute of Technology (342)
- University of Central Florida (333)
- Washington University in St. Louis (313)
- Embry-Riddle Aeronautical University (311)
- China Simulation Federation (308)
- Nova Southeastern University (295)
- Kennesaw State University (280)
- University of Arkansas, Fayetteville (266)
- Utah State University (259)
- University of South Florida (252)
- University of Texas at Arlington (252)
- Zayed University (252)
- Syracuse University (245)
- Keyword
-
- Machine learning (1031)
- Deep learning (593)
- Artificial intelligence (509)
- Machine Learning (497)
- Security (364)
-
- Computer Science (342)
- Deep Learning (292)
- Artificial Intelligence (261)
- Classification (260)
- Cybersecurity (243)
- Computer vision (229)
- Department of Computer Science and Engineering (211)
- Privacy (211)
- Neural networks (205)
- Algorithms (203)
- Data mining (193)
- Natural language processing (186)
- Computer science (181)
- Applied sciences (171)
- College for Professional Studies (165)
- Software engineering (163)
- School of Computer & Information Science (150)
- Simulation (146)
- AI (142)
- Optimization (138)
- Blockchain (133)
- Image processing (133)
- Natural Language Processing (133)
- Clustering (128)
- Education (123)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (4205)
- Theses and Dissertations (1686)
- Turkish Journal of Electrical Engineering and Computer Sciences (1233)
- Department of Computer Science Technical Reports (906)
- Master's Projects (565)
-
- Computer Science Faculty Publications (435)
- Computer Science Technical Reports (404)
- Computer Science Faculty Research & Creative Works (385)
- Electronic Theses and Dissertations (385)
- Dissertations (362)
- The R Journal (353)
- Faculty Publications (351)
- Journal of System Simulation (308)
- CCAC Theses and Dissertations (277)
- Browse all Theses and Dissertations (262)
- Theses (253)
- All Works (252)
- USF Tampa Graduate Theses and Dissertations (230)
- Computer Science Faculty Publications and Presentations (229)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (217)
- Masters Theses (215)
- Computer Science & Engineering Syllabi (214)
- Departmental Technical Reports (CS) (212)
- Walden Dissertations and Doctoral Studies (210)
- Master's Theses (209)
- All Computer Science and Engineering Research (205)
- Kno.e.sis Publications (196)
- Computer Science and Software Engineering (180)
- Open Access Theses & Dissertations (171)
- Regis University Student Publications (comprehensive collection) (166)
- Publication Type
Articles 27421 - 27450 of 27587
Full-Text Articles in Entire DC Network
Secure Statistical Databases With Random Sample Queries, Dorothy E. Denning
Secure Statistical Databases With Random Sample Queries, Dorothy E. Denning
Department of Computer Science Technical Reports
No abstract provided.
Hash-Binary Search: A Fast Technique For Searching An English Spelling Dictionary, Douglas E. Comer, Vincent Y. Shen
Hash-Binary Search: A Fast Technique For Searching An English Spelling Dictionary, Douglas E. Comer, Vincent Y. Shen
Department of Computer Science Technical Reports
No abstract provided.
Terminal Talk - The Wofford Connection - February 1979, Wofford College Computer Center
Terminal Talk - The Wofford Connection - February 1979, Wofford College Computer Center
Terminal Talk
No abstract provided.
Optimal 2,3-Trees, Nicholas J. Pippenger, Raymond E. Miller, Arnold L. Rosenberg, Lawrence Snyder
Optimal 2,3-Trees, Nicholas J. Pippenger, Raymond E. Miller, Arnold L. Rosenberg, Lawrence Snyder
All HMC Faculty Publications and Research
The 2,3-trees that are optimal in the sense of having minimal expected number of nodes visited per access are characterized in terms of their “profiles”. The characterization leads directly to a linear-time algorithm for constructing a K-key optimal 2,3-tree for a sorted list of K keys. A number of results are derived that demonstrate how different in structure these optimal 2,3-trees are from their “average” cousins.
Making Curriculum Decisions And The Nature Of Mathematics, Paul Zwier
Making Curriculum Decisions And The Nature Of Mathematics, Paul Zwier
ACMS Journal 2004
This paper clearly presents eight aspects of mathematics and contrasting perspectives in each that will affect the teaching of mathematics and the design of curricula. It also presents a collection of affirmations that could reasonably characterize a Christian perspective on teaching mathematics.
A Computer Model For Evaluating Corn Harvesting, Handling, Drying And Storage Systems, Thomas C. Bridges, Otto J. Loewer Jr., John N. Walker, Douglas G. Overhults
A Computer Model For Evaluating Corn Harvesting, Handling, Drying And Storage Systems, Thomas C. Bridges, Otto J. Loewer Jr., John N. Walker, Douglas G. Overhults
Biosystems and Agricultural Engineering Faculty Publications
No abstract provided.
The Cusp Catastrophe And The Laws Of Dialectics, Martin Zwick
The Cusp Catastrophe And The Laws Of Dialectics, Martin Zwick
Complex Systems Faculty Publications and Presentations
The three classical "laws" of dialectics of Hegel and Engels, ( 1) the transformation of quantity into quality, (2) the interpenetration of opposites, and (3) the negation of the negation, can be given precise meanings in terms of the Catastrophe Theory of Rene Thom and E. C. Zeeman. This suffices to counter the charge that dialectics is scholasticism or empty metaphysics, but does not support claims of universality for the dialectical principles, nor guarantee the validity of any particular application of these principles.
An Investigation Of Montmort's "Probleme De Recontres" And Generalizations, Ronald I. Greenberg
An Investigation Of Montmort's "Probleme De Recontres" And Generalizations, Ronald I. Greenberg
Computer Science: Faculty Publications and Other Works
I have investigated a problem which may be phrased in many ways, such as finding the probability of answering a given number of questions correctly on a randomly-completed matching test which may have a number of extra "dud" answers. I have determined such probabilities, the average number of correct answers, and other allied results. I have also investigated a related problem involving the number of ways of choosing a different element from each of a certain collection of sets.
Historical Development Of Computer Science At Purdue University, S. D. Conte
Historical Development Of Computer Science At Purdue University, S. D. Conte
Department of Computer Science Technical Reports
No abstract provided.
Applications Of Classical Recursion Theory To Computer Science, Carl H. Smith
Applications Of Classical Recursion Theory To Computer Science, Carl H. Smith
Department of Computer Science Technical Reports
No abstract provided.
A Simple Experiment In Top-Down Design, Douglas E. Comer, M. H. Halstead
A Simple Experiment In Top-Down Design, Douglas E. Comer, M. H. Halstead
Department of Computer Science Technical Reports
No abstract provided.
The Relationship Between Student Grades And Software Science Parameters, V. Y. Shen
The Relationship Between Student Grades And Software Science Parameters, V. Y. Shen
Department of Computer Science Technical Reports
No abstract provided.
An Inductive Inference Bibliography, Carl H. Smith
An Inductive Inference Bibliography, Carl H. Smith
Department of Computer Science Technical Reports
No abstract provided.
A Programming Language Theorem Which Is Independent Of Peano Arithmetic, Michael O'Donnell
A Programming Language Theorem Which Is Independent Of Peano Arithmetic, Michael O'Donnell
Department of Computer Science Technical Reports
No abstract provided.
On Learning How To Predict, Peter J. Denning
On Learning How To Predict, Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.
Ellpack Network User's Guide, Ron Boisvert, John Brophy, John R. Rice, John Warner
Ellpack Network User's Guide, Ron Boisvert, John Brophy, John R. Rice, John Warner
Department of Computer Science Technical Reports
No abstract provided.
Matching Tree Patterns, Christoph M. Hoffmann
Matching Tree Patterns, Christoph M. Hoffmann
Department of Computer Science Technical Reports
No abstract provided.
A User's Introduction To The Dual-Mace Operating System, V. Y. Shen, Stephen Tolopka
A User's Introduction To The Dual-Mace Operating System, V. Y. Shen, Stephen Tolopka
Department of Computer Science Technical Reports
No abstract provided.
The Data Management Subsystem Of The System For Performance Evaluation Of Pde Software, J. M. Bonnet, R. F. Boisvert
The Data Management Subsystem Of The System For Performance Evaluation Of Pde Software, J. M. Bonnet, R. F. Boisvert
Department of Computer Science Technical Reports
No abstract provided.
On List Structures And Their Use In The Programming Of Unification, F. Lockwood Morris
On List Structures And Their Use In The Programming Of Unification, F. Lockwood Morris
Electrical Engineering and Computer Science - Technical Reports
The notion of list structure is discussed, and a new construct is introduced into LISP which permits the computation of list structures containing cycles without recourse to operations which alter existing structures. It is shown that list structures can be used to represent both finite and “rational” infinite terms. Substitutions (generalized for a term algebra which includes infinite terms) are discussed, “tables” are introduced as an abstract data type, and two methods of representing substitutions by tables, together with their interrelation, are considered. Concise programs are given for a succession of forms of Robinson’s unification algorithm, including one which operates …
Homogeneous Approximations Of General Queueing Networks, Gianfranco Balbo, Peter J. Dennins
Homogeneous Approximations Of General Queueing Networks, Gianfranco Balbo, Peter J. Dennins
Department of Computer Science Technical Reports
No abstract provided.
Data Security, Dorothy E. Denning, Peter J. Denning
Data Security, Dorothy E. Denning, Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.
Quantitative Estimates Of Debugging Requirements, Linda M. Ottenstein
Quantitative Estimates Of Debugging Requirements, Linda M. Ottenstein
Department of Computer Science Technical Reports
No abstract provided.
Secure Personal Computing In An Insecure Network, Dorothy E. Denning
Secure Personal Computing In An Insecure Network, Dorothy E. Denning
Department of Computer Science Technical Reports
No abstract provided.
Working Sets Past And Present, Peter J. Denning
Working Sets Past And Present, Peter J. Denning
Department of Computer Science Technical Reports
No abstract provided.
Ellpack 77 Contributor's Guide, John R. Rice
Ellpack 77 Contributor's Guide, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
A Qualitative Justification For A Measure Of Program Clarity, Ronald D. Gordon
A Qualitative Justification For A Measure Of Program Clarity, Ronald D. Gordon
Department of Computer Science Technical Reports
No abstract provided.
On Combinational Networks With Restricted Fan-Out, K. L. Kodandapani, Sharad C. Seth
On Combinational Networks With Restricted Fan-Out, K. L. Kodandapani, Sharad C. Seth
School of Computing: Faculty Publications
Fan-out-free networks of AND, OR, NOT, EXOR, and MAJORITY gates are considered. Boolean functions for which such networks exist are defined to be fan-out free. The paper solves the following problems regarding the fan-out-free networks and functions.
1) Characterization of the class of fan-out-free functions: The characterization given is constructive in the sense that if a given function is fan-out free one obtains a fan-out-free network to realize it.
2) Counting the class of fan-out-free functions: After establishing a correspondence between a fan-out-free function and a normalized network realizing it, a series of formulas are developed to count distinct normal …
Measuring Improvements In Program Clarity, Ronald D. Gordon
Measuring Improvements In Program Clarity, Ronald D. Gordon
Department of Computer Science Technical Reports
No abstract provided.
Geometric Problems With Application To Hashing, Douglas E. Comer, Michael J. O'Donnell
Geometric Problems With Application To Hashing, Douglas E. Comer, Michael J. O'Donnell
Department of Computer Science Technical Reports
No abstract provided.