Open Access. Powered by Scholars. Published by Universities.®
- Institution
-
- Singapore Management University (5830)
- China Simulation Federation (3924)
- TÜBİTAK (2852)
- Missouri University of Science and Technology (1081)
- University of Nebraska - Lincoln (1079)
-
- Old Dominion University (936)
- Edith Cowan University (829)
- Embry-Riddle Aeronautical University (693)
- Zayed University (683)
- Wright State University (648)
- Purdue University (560)
- University of Texas at El Paso (523)
- Technological University Dublin (456)
- Kennesaw State University (438)
- San Jose State University (371)
- Walden University (368)
- Dartmouth College (316)
- Marquette University (275)
- New Jersey Institute of Technology (264)
- Karbala International Journal of Modern Science (263)
- City University of New York (CUNY) (257)
- University of Nebraska at Omaha (257)
- MMU Press (252)
- Brigham Young University (238)
- Neutrosophic Systems with Applications (237)
- Smith College (208)
- Chulalongkorn University (207)
- Syracuse University (203)
- California Polytechnic State University, San Luis Obispo (198)
- Portland State University (196)
- Keyword
-
- Machine learning (860)
- Artificial intelligence (611)
- Deep learning (595)
- Machine Learning (351)
- Security (323)
-
- Cybersecurity (280)
- Computer Science (270)
- Artificial Intelligence (242)
- Simulation (240)
- Classification (231)
- Privacy (231)
- Deep Learning (212)
- Optimization (205)
- Neural networks (186)
- Data mining (182)
- Natural language processing (174)
- Technical Reports (166)
- UTEP Computer Science Department (166)
- AI (163)
- Blockchain (161)
- Computer science (157)
- Reinforcement learning (156)
- Cloud computing (155)
- Algorithms (154)
- Feature extraction (145)
- Social media (143)
- Clustering (142)
- Genetic algorithm (140)
- Engineering (133)
- Computer vision (131)
- Publication Year
- Publication
-
- Research Collection School Of Computing and Information Systems (5576)
- Journal of System Simulation (3924)
- Turkish Journal of Electrical Engineering and Computer Sciences (2852)
- The R Journal (708)
- All Works (681)
-
- Computer Science Faculty Research & Creative Works (590)
- Computer Science Faculty Publications (532)
- Journal of Digital Forensics, Security and Law (481)
- Departmental Technical Reports (CS) (469)
- Department of Computer Science Technical Reports (456)
- Theses and Dissertations (422)
- Walden Dissertations and Doctoral Studies (365)
- Faculty Publications (341)
- Master's Projects (288)
- Karbala International Journal of Modern Science (263)
- Computer Science Technical Reports (254)
- Dissertations (253)
- Journal of Informatics and Web Engineering (252)
- Neutrosophic Systems with Applications (237)
- Kno.e.sis Publications (232)
- Chulalongkorn University Theses and Dissertations (Chula ETD) (207)
- Research outputs 2022 to 2026 (202)
- Mathematics, Statistics and Computer Science Faculty Research and Publications (201)
- Computer Science Faculty Publications and Presentations (194)
- Conference papers (190)
- Articles (188)
- Computer Science: Faculty Publications (170)
- Electrical and Computer Engineering Faculty Research & Creative Works (168)
- Journal of Cybersecurity Education, Research and Practice (152)
- Computer Science and Engineering Faculty Publications (149)
- Publication Type
Articles 31471 - 31500 of 31906
Full-Text Articles in Entire DC Network
Optimal Superprimitivity Testing For Strings, Alberto Apostolico, Martin Farach, Costas S. Iliopoulos
Optimal Superprimitivity Testing For Strings, Alberto Apostolico, Martin Farach, Costas S. Iliopoulos
Department of Computer Science Technical Reports
No abstract provided.
Implementation And Performance Of A Communication Facility For Distributed Transaction Processing, Enrique Mafla, Bharat Bhargava
Implementation And Performance Of A Communication Facility For Distributed Transaction Processing, Enrique Mafla, Bharat Bhargava
Department of Computer Science Technical Reports
No abstract provided.
Managing Data Synchronization Automatically For Distributed-Memory Architectures, Ko-Yang Wang
Managing Data Synchronization Automatically For Distributed-Memory Architectures, Ko-Yang Wang
Department of Computer Science Technical Reports
No abstract provided.
Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka
Hypercube Algorithms For Operations On Quadtrees, Ravi V. Shankar, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper describes parallel algorithms for the following operations on quadtrees - boolean operations (union, intersection, complement), collapsing a quadtree, and neighbor finding in an image represented by a quadtree. The architecture assumed in this paper is a hypercube with one processing element (PE) per hypercube node. We assume that the architecture is SIMD, i.e., all PEs work under the control of a single control unit.
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1990, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, November 1990, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
A ten page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Forecasting The Behavior Of Multivariate Time Series Using Neural Networks, Kanad Charkraborty, Kishan Mehrotra, Chilukuri K. Mohan, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper presents a neural network approach to multivariate time-series analysis. Real world observations of flour prices in three cities have been used as a benchmark in our experiments. Feedforward connectionist networks have been designed to model flour prices over the period from August 1972 to November 1980 for the cities of Buffalo, Minneapolis, and Kansas City. Remarkable success has been achieved in training the networks to learn the price curve for each of these cities, and thereby to make accurate price predictions. Our results show that the neural network approach leads to better predictions than the autoregressive moving average(ARMA) …
Software Performance Evaluation Papers In Toms, Volumes 1-15, John R. Rice
Software Performance Evaluation Papers In Toms, Volumes 1-15, John R. Rice
Department of Computer Science Technical Reports
No abstract provided.
A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka
A Space And Time Efficient Coding Algorithm For Lattíce Computations, Deb Dutta Ganguly, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
This paper presents an encoding algorithm to enable fast computation of the least upper bound (LUB) and greatest lower bound (GLB) of a partially ordered set. The algorithm presented reduces the LUB computation to an OR operation on the codes. The GLB computation is reduced essentially to an AND operation on the codes. The time complexity of our encoding algorithm is O(n + e) where n is the number of nodes and e is the number of edges. With respect to space requirements the algorithm presented gives good results for small lattices (code length was 50 bits for a 300 …
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1990, College Of Engineering And Computer Science, Wright State University
Wright State University College Of Engineering And Computer Science Bits And Pcs Newsletter, October 1990, College Of Engineering And Computer Science, Wright State University
BITs and PCs Newsletter
An eight page newsletter created by the Wright State University College of Engineering and Computer Science that addresses the current affairs of the college.
Domain Decomposer: A Software Tool For Mapping Pde Computations To Parallel Architectures, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, P. N. Papachiou, S. K. Kortesis
Domain Decomposer: A Software Tool For Mapping Pde Computations To Parallel Architectures, N. P. Chrisochoides, C. E. Houstis, Elias N. Houstis, P. N. Papachiou, S. K. Kortesis
Department of Computer Science Technical Reports
No abstract provided.
Global Concurrency Control In Heterogeneous Distributed Database Systems, Ahmed K. Elmagarmid, Weimin Du, Yungho Leu
Global Concurrency Control In Heterogeneous Distributed Database Systems, Ahmed K. Elmagarmid, Weimin Du, Yungho Leu
Department of Computer Science Technical Reports
No abstract provided.
Surface Reasoning, William C. Purdy
Surface Reasoning, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
Surface reasoning is defined to be deduction conducted in the surface language in terms of certain primitive logical relations. The surface language is a spoken or written natural language (in this paper, English), in contrast to a "base language" or “deep structure" sometimes hypothesized to explain natural language phenomena. The primitive logical relations are inclusion, exclusion and overlap between classes of entities. A calculus for surface reasoning is presented. Then a model for reasoning in this calculus is developed. The model is similar to but more general than syllogistic. In this model, reasoning is represented as construction of fragments (subposets) …
Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng
Gateway Design For Lan Interconnection Via Isdn, Xian-Yu Zhang, Robert H. Deng
Research Collection School Of Computing and Information Systems
Recently, the use of bridges/gateways to interconnect physically distant local area networks (LANs) has become increasingly popular. There are various ways of connecting these bridges/gateways. ISDN is one of them and an attractive one. In this paper we discuss our work in the gateway design for interconnecting LANs via ISDN.
Notions Of Relative Ubiquity For Invariant Sets Of Relational Structures, Paul Bankston, Wim Ruitenburg
Notions Of Relative Ubiquity For Invariant Sets Of Relational Structures, Paul Bankston, Wim Ruitenburg
Mathematics, Statistics and Computer Science Faculty Research and Publications
Given a finite lexicon L of relational symbols and equality, one may view the collection of all L-structures on the set of natural numbers w as a space in several different ways. We consider it as: (i) the space of outcomes of certain infinite two-person games; (ii) a compact metric space; and (iii) a probability measure space. For each of these viewpoints, we can give a notion of relative ubiquity, or largeness, for invariant sets of structures on w. For example, in every sense of relative ubiquity considered here, the set of dense linear orderings on w is …
The Origins Of Modern Computing, Saul Rosen
The Origins Of Modern Computing, Saul Rosen
Department of Computer Science Technical Reports
No abstract provided.
Efficient Parallel Binary Search On Sorted Arrays, Danny Z. Chen
Efficient Parallel Binary Search On Sorted Arrays, Danny Z. Chen
Department of Computer Science Technical Reports
No abstract provided.
Computing Some Distance Functions Between Polygons, Mikhail J. Atallah, Celso C. Ribeiro, Sergio Lifschitz
Computing Some Distance Functions Between Polygons, Mikhail J. Atallah, Celso C. Ribeiro, Sergio Lifschitz
Department of Computer Science Technical Reports
No abstract provided.
History Of The Computer Sciences Department At Purdue University, John R. Rice, Saul Rosen
History Of The Computer Sciences Department At Purdue University, John R. Rice, Saul Rosen
Department of Computer Science Technical Reports
No abstract provided.
Mesh And Pyramid Algorithms For Iconic Indexing, Alok Choudhary, Sanjay Ranka
Mesh And Pyramid Algorithms For Iconic Indexing, Alok Choudhary, Sanjay Ranka
Electrical Engineering and Computer Science - Technical Reports
In this paper parallel algorithms on meshes and pyramids for iconic indexing are presented. Our algorithms are asymptotically superior to previously known parallel algorithms.
Efficient Detection Of Quasiperiodicities In Strings, Alberto Apostolico, Andrzej Ehrenfeucht
Efficient Detection Of Quasiperiodicities In Strings, Alberto Apostolico, Andrzej Ehrenfeucht
Department of Computer Science Technical Reports
No abstract provided.
Unifying Parametric And Implicit Surface Representations For Computer Graphics: Parametric Surface Display And Algebraic Surface Fitting, Changrajit L. Bajaj
Unifying Parametric And Implicit Surface Representations For Computer Graphics: Parametric Surface Display And Algebraic Surface Fitting, Changrajit L. Bajaj
Department of Computer Science Technical Reports
No abstract provided.
A Statically-Typed Language With Classes, Mike Beaven, Ryan Stanisfer, Dan Wetklow
A Statically-Typed Language With Classes, Mike Beaven, Ryan Stanisfer, Dan Wetklow
Department of Computer Science Technical Reports
No abstract provided.
The Cops Security Checker System, Daniel Farmer, Eugene H. Spafford
The Cops Security Checker System, Daniel Farmer, Eugene H. Spafford
Department of Computer Science Technical Reports
No abstract provided.
A Logic For Natural Language, William C. Purdy
A Logic For Natural Language, William C. Purdy
Electrical Engineering and Computer Science - Technical Reports
This paper describes a language called £N whose structure mirrors that of natural language. £N is characterized by absence of variables and individual constants. Singular predicates assume the role of both individual constants and free variables. The role of bound variables is played by predicate functors called "selection operators." Like natural languages, £N is implicitly many-sorted. £N does not have an identity relation. Its expressive power lies between the predicate calculus without identity and the predicate calculus with identity. The loss in expressiveness relative to the predicate calculus with identity however is not significant. Deduction in £N is intended to …
Convex Decomposition Of Polyhedra And Robustness, Chanderjit Bajaj, Tamal K. Dey
Convex Decomposition Of Polyhedra And Robustness, Chanderjit Bajaj, Tamal K. Dey
Department of Computer Science Technical Reports
No abstract provided.
Digital Search Trees Again Revisited: The Internal Path Length Perspective, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
Digital Search Trees Again Revisited: The Internal Path Length Perspective, Peter Kirschenhofer, Helmut Prodinger, Wojciech Szpankowski
Department of Computer Science Technical Reports
No abstract provided.
A Simpler Proof Of Ph C Bp[Өp], Kenneth W. Regan, James S. Royer
A Simpler Proof Of Ph C Bp[Өp], Kenneth W. Regan, James S. Royer
Electrical Engineering and Computer Science - Technical Reports
We simplify the proof by S. Toda [Tod89] that the polynomial hierarchy PH is contained in BP[ӨP]. Our methods bypass the technical quantifier interchange lemmas in the original proof, and clarify the counting principles on which the result depends. We also show that relative to a random oracle R, PHR is strictly contained in ӨPR.
Typed Token Approach For Database Processing During Network Partitioning, Bharat Bhargava, Shy-Renn Lian
Typed Token Approach For Database Processing During Network Partitioning, Bharat Bhargava, Shy-Renn Lian
Department of Computer Science Technical Reports
No abstract provided.
A Data Structure For Analyzing Collisions Of Moving Objects, George Vanecek
A Data Structure For Analyzing Collisions Of Moving Objects, George Vanecek
Department of Computer Science Technical Reports
No abstract provided.
Taxonomies Of Model-Theoretically Defined Topological Properties, Paul Bankston
Taxonomies Of Model-Theoretically Defined Topological Properties, Paul Bankston
Mathematics, Statistics and Computer Science Faculty Research and Publications
A topological classification scheme consists of two ingredients: (1) an abstract class K of topological spaces; and (2) a "taxonomy", i.e. a list of first order sentences, together with a way of assigning an abstract class of spaces to each sentence of the list so that logically equivalent sentences are assigned the same class.K, is then endowed with an equivalence relation, two spaces belonging to the same equivalence class if and only if they lie in the same classes prescribed by the taxonomy. A space X in K is characterized within the classification scheme if whenever Y E …