Results 31 to 40 of about 3,543,110 (254)
Autocorrect pada Modul Pencarian Drugs e-Dictionary Menggunakan Algoritma Levenshtein Distance
Jurnal RESTI (Rekayasa Sistem dan Teknologi Informasi), 2020 The Dictionary of Medicine in the form of a physical book has many drawbacks, one of them is its thickness makes it impractical to be carried. This becomes a motivation to develop drug dictionary applications in the form of a Drugs e-Dictionary.
Halimah Tus Sadiah +2 more
doaj +1 more source
Proximity Drawings of High-Degree Trees [PDF]
, 2010 A drawing of a given (abstract) tree that is a minimum spanning tree of the vertex set is considered aesthetically pleasing. However, such a drawing can only exist if the tree has maximum degree at most 6. What can be said for trees of higher degree?
Barát J. +5 more
core +1 more source
Calculation of cutting force by book-edge trimming with disk knives
Proceedings, 2022 The paper proposes formulas for theoretical calculation of forces when trimming book-edges with a disc knife. The theoretical model is based on experimental data obtained by the authors.
G. Petriaszwili +3 more
semanticscholar +1 more source
Journal of Chemistry, 2021 Ancient stamps are suffering from the destructive effects of different kinds of inks that were prepared from different ingredients. Two Egyptian historical postage stamps printed in blue and red printing inks were evaluated and examined for their ...
Maisa M.A. Mansour +6 more
doaj +1 more source
Graph Treewidth and Geometric Thickness Parameters
, 2005 Consider a drawing of a graph $G$ in the plane such that crossing edges are coloured differently. The minimum number of colours, taken over all drawings of $G$, is the classical graph parameter "thickness".
C.S..J.A. Nash-Williams +13 more
core +4 more sources
Experimental Evaluation of Book Drawing Algorithms
, 2017 A $k$-page book drawing of a graph $G=(V,E)$ consists of a linear ordering of its vertices along a spine and an assignment of each edge to one of the $k$ pages, which are half-planes bounded by the spine. In a book drawing, two edges cross if and only if
Klawitter, Jonathan +2 more
core +2 more sources
Four Pages Are Indeed Necessary for Planar Graphs [PDF]
, 2020 An embedding of a graph in a book consists of a linear order of its vertices along the spine of the book and of an assignment of its edges to the pages of the book, so that no two edges on the same page cross. The book thickness of a graph is the minimum
Bekos, Michael A. +5 more
core +1 more source
Design issues in the production of hyper‐books and visual‐books [PDF]
, 1993 This paper describes an ongoing research project in the area of electronic books. After a brief overview of the state of the art in this field, two new forms of electronic book are presented: hyper‐books and visual‐books.
Catenazzi, Nadia +2 more
core +3 more sources
Media Komunikasi Teknik Sipil, 2015 Based on the book of open channels hydraulics by Ven T. Chow (1988) mentioned that the big problems in application Manning equation is determine of roughness coefficien n, because there is no certain way to choose value of n.
Haryono Putro, Joetata Hadihardaja
doaj +1 more source
Stack and Queue Layouts via Layered Separators
, 2016 It is known that every proper minor-closed class of graphs has bounded stack-number (a.k.a. book thickness and page number). While this includes notable graph families such as planar graphs and graphs of bounded genus, many other graph families are not ...
ED Demaine +15 more
core +1 more source