Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Artificial Intelligence and Robotics (14)
- Mathematics (9)
- Data Science (6)
- Engineering (6)
- Databases and Information Systems (5)
-
- Other Computer Sciences (5)
- Software Engineering (5)
- Computer Engineering (4)
- Other Mathematics (4)
- Discrete Mathematics and Combinatorics (3)
- Aerospace Engineering (2)
- Applied Mathematics (2)
- Computational Engineering (2)
- Electrical and Computer Engineering (2)
- Graphics and Human Computer Interfaces (2)
- Information Security (2)
- Medicine and Health Sciences (2)
- Multi-Vehicle Systems and Air Traffic Control (2)
- Numerical Analysis and Computation (2)
- Numerical Analysis and Scientific Computing (2)
- Programming Languages and Compilers (2)
- Statistics and Probability (2)
- Algebraic Geometry (1)
- Analysis (1)
- Analytical Chemistry (1)
- Analytical, Diagnostic and Therapeutic Techniques and Equipment (1)
- Applied Statistics (1)
- Institution
- Keyword
-
- Daniel Felix Ritchie School of Engineering and Computer Science (11)
- Machine learning (7)
- Computer Science (6)
- Multiple instance learning (3)
- Artificial intelligence (AI) (2)
-
- Electrical and Computer Engineering (2)
- Facial expression recognition (2)
- TLA+ (2)
- ANFIS (1)
- Abstraction and refinement (1)
- Algorithmic bias (1)
- Approximation algorithms (1)
- Artificial Intelligence (1)
- Assessment (1)
- Audio signal processing (1)
- BEO detection (1)
- Basketball Analytics (1)
- Bayesian statistics (1)
- CAmkES (1)
- Calculus of variations (1)
- Class mutability (1)
- Classification (1)
- Clustering (1)
- Code evaluation (1)
- Code quality (1)
- Collaborative filtering (1)
- Combinatorics (1)
- Computational geometry (1)
- Computer science (1)
- Computer science education (1)
Articles 31 - 33 of 33
Full-Text Articles in Theory and Algorithms
Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points, Yan B. Mayster
Minimax And Maximin Fitting Of Geometric Objects To Sets Of Points, Yan B. Mayster
Electronic Theses and Dissertations
This thesis addresses several problems in the facility location sub-area of computational geometry. Let S be a set of n points in the plane. We derive algorithms for approximating S by a step function curve of size k < n, i.e., by an x-monotone orthogonal polyline ℜ with k < n horizontal segments. We use the vertical distance to measure the quality of the approximation, i.e., the maximum distance from a point in S to the horizontal segment directly above or below it. We consider two types of problems: min-ε, where the goal is to minimize the error for a …
Generating Compact Wasp Nest Structures Via Minimal Complexity Algorithms., Fadel Ewusi Kofi Adoe
Generating Compact Wasp Nest Structures Via Minimal Complexity Algorithms., Fadel Ewusi Kofi Adoe
Electronic Theses and Dissertations
Many models have been developed to explain the process of self organization-the emergence of seemingly purposeful behaviors from groups of entities with limited individual intelligence. However, the underlying behavior that facilitates the emergence of this global pattern is not generally well understood. Our study focuses on different low complexity building algorithms and characterizes how nests are built using these algorithms. Three rules postulated to be functions of wasps' building behavior were developed. First is the random rule, in which there is no constraint per the choice of site to be initiated. The second is the 2-cell rule where only sites …
Strategies For Encoding Xml Documents In Relational Databases: Comparisons And Contrasts., Jonathan Lee Leonard
Strategies For Encoding Xml Documents In Relational Databases: Comparisons And Contrasts., Jonathan Lee Leonard
Electronic Theses and Dissertations
The rise of XML as a de facto standard for document and data exchange has created a need to store and query XML documents in relational databases, today's de facto standard for data storage. Two common strategies for storing XML documents in relational databases, a process known as document shredding, are Interval encoding and ORDPATH Encoding. Interval encoding, which uses a fixed mapping for shredding XML documents, tends to favor selection queries, at a potential cost of O(N) for supporting insertion queries. ORDPATH Encoding, which uses a looser mapping for shredding XML, supports fixed-cost insertions, at a potential cost of …