Open Access. Powered by Scholars. Published by Universities.®
Physical Sciences and Mathematics Commons™
Open Access. Powered by Scholars. Published by Universities.®
- Discipline
-
- Computer Sciences (275)
- Engineering (70)
- Social and Behavioral Sciences (57)
- Computer Engineering (47)
- Digital Communications and Networking (39)
-
- Medicine and Health Sciences (39)
- Databases and Information Systems (38)
- Artificial Intelligence and Robotics (37)
- Life Sciences (37)
- Library and Information Science (34)
- Theory and Algorithms (23)
- Applied Mathematics (20)
- Biochemistry, Biophysics, and Structural Biology (17)
- Genetics and Genomics (17)
- Archival Science (16)
- Graphics and Human Computer Interfaces (16)
- Anatomy (14)
- Computational Biology (14)
- Cataloging and Metadata (11)
- Medical Specialties (11)
- Mathematics (10)
- Biochemistry (9)
- Numerical Analysis and Scientific Computing (9)
- Public Affairs, Public Policy and Public Administration (9)
- Biomedical Engineering and Bioengineering (8)
- Chemicals and Drugs (8)
- Data Science (8)
- Electrical and Computer Engineering (8)
- Information Security (8)
- Keyword
-
- Digital libraries (22)
- Deep learning (17)
- Machine learning (12)
- Computer science (11)
- Web archiving (11)
-
- Algorithms (10)
- Neural networks (10)
- Web archives (10)
- Metadata (8)
- Cryo-electron microscopy (7)
- Image (7)
- Information systems (7)
- Memento (7)
- Mesh generation (7)
- Protein structure (7)
- Secondary structure (7)
- Design (6)
- Digital preservation (6)
- Graphs (6)
- Information retrieval (6)
- Protein (6)
- World Wide Web (6)
- Artificial intelligence (5)
- Computing methodologies (5)
- Eye tracking (5)
- Information dissemination (5)
- Screen reader (5)
- Sensor networks (5)
- Summarization (5)
- Telecommunications (5)
- Publication Year
- File Type
Articles 271 - 279 of 279
Full-Text Articles in Physical Sciences and Mathematics
On A Unique Tree Representation For P4-Extendible Graphs, B. Jamison, S. Olariu
On A Unique Tree Representation For P4-Extendible Graphs, B. Jamison, S. Olariu
Computer Science Faculty Publications
Several practical applications in computer science and computational linguistics suggest the study of graphs that are unlikely to have more than a few induced paths of length three. These applications have motivated the notion of a cograph, defined by the very strong restriction that no vertex may belong to an induced path of length three. The class of P4-extendible graphs that we introduce in this paper relaxes this restriction, and in fact properly contains the class of cographs, while still featuring the remarkable property of admitting a unique tree representation. Just as in the case of cographs, the …
Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala
Pipelining Data Compression Algorithms, R. L. Bailey, R. Mukkamala
Computer Science Faculty Publications
Many different data compression techniques currently exist. Each has its own advantages and disadvantages. Combining (pipelining) multiple data compression techniques could achieve better compression rates than is possible with either technique individually. This paper proposes a pipelining technique and investigates the characteristics of two example pipelining algorithms. Their performance is compared with other well-known compression techniques.
Wings And Perfect Graphs, Stephan Olariu
Wings And Perfect Graphs, Stephan Olariu
Computer Science Faculty Publications
An edge uv of a graph G is called a wing if there exists a chordless path with vertices u, v, x, y and edges uv, vx, xy. The wing-graph W(G) of a graph G is a graph having the same vertex set as G; uv is an edge in W(G) if and only if uv is a wing in G. A graph G is saturated if G is isomorphic to W(G). A star-cutset in a graph G is a non-empty set of …
Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell
Efficient Schemes To Evaluate Transaction Performance In Distributed Database Systems, R. Mukkamala, S. C. Bruell
Computer Science Faculty Publications
Database designers and researchers often need efficient schemes to evaluate transaction performance. In this paper, we chose two important performance measures: the average number of nodes accessed and the average number of data items accessed per node by a transaction in a distributed database system. We derive analytical expressions to evaluate these metrics. For general applicability, we consider partially replicated distributed database systems. Our first set of analytic results are closed-form expressions for these two measures. These are based on some fairly restrictive simplifying assumptions. When these assumptions are relaxed, no closed-form expressions exist for these averages. Hence, we develop …
A New Conjecture About Minimal Imperfect Graphs, H. Meyniel, Stephan Olariu
A New Conjecture About Minimal Imperfect Graphs, H. Meyniel, Stephan Olariu
Computer Science Faculty Publications
H. Meyniel proved that in every minimal imperfect graph, every pair of vertices is joined by a chordless path containing an odd number of edges. We conjectured that in every minimal imperfect graph, every pair of vertices is joined by a path containing an even number of edges. We give an equivalent version of this new conjecture.
The Strong Perfect Graph Conjecture For Pan-Free Graphs, Stephan Olariu
The Strong Perfect Graph Conjecture For Pan-Free Graphs, Stephan Olariu
Computer Science Faculty Publications
A graph G is perfect if for every induced subgraph F of G, the chromatic number χ(F) equals the largest number ω(F) of pairwise adjacent vertices in F. Berge's famous Strong Perfect Graph Conjecture asserts that a graph G is perfect if and only if neither G nor its complement G contains an odd chordless cycle of length at least five. Its resolution has eluded researchers for more than twenty years. We prove that the conjecture is true for a class of graphs which strictly contains the claw-free graphs.
Weak Bipolarizable Graphs, Stephan Olariu
Weak Bipolarizable Graphs, Stephan Olariu
Computer Science Faculty Publications
We characterize a new class of perfectly orderable graphs and give a polynomial-time recognition algorithm, together with linear-time optimization algorithms for this class of graphs.
No Antitwins In Minimal Imperfect Graphs, Stephan Olariu
No Antitwins In Minimal Imperfect Graphs, Stephan Olariu
Computer Science Faculty Publications
It is customary to call vertices x and y twins if every vertex distinct from x and y is adjacent either to both of them or to neither of them. By analogy, we shall call vertices x and yantitwins if every vertex distinct from x and y is adjacent to precisely one of them. Lovász proved that no minimal imperfect graph has twins. The purpose of this note is to prove the analogous statement for antitwins.
An Algorithm For The Electromagnetic Scattering Due To An Axially Symmetric Body With An Impedance Boundary Condition, F. Stenger, M. Hagmann, J. Scheing
An Algorithm For The Electromagnetic Scattering Due To An Axially Symmetric Body With An Impedance Boundary Condition, F. Stenger, M. Hagmann, J. Scheing
Computer Science Faculty Publications
Let B be a body in R3, and let S denote the boundary of B. The surface S is described by S = {(x, y, z): (x2 + Y2)½= ƒ(z), -1≤ z ≤ I}, where ƒ analytic function that is real and positive on (-1, 1) and ƒ(±1) = 0. An algorithm is described for computing the scattered field due to a plane wave incident field, under Leontovich boundary conditions. The Galerkin method of solution used here leads to a block diagonal matrix involving 2M …