Results 291 to 300 of about 3,592,441 (346)

Embedding the incomplete hypercube in books

Information Processing Letters, 2005
In this paper, we study the linear layout problem of an incomplete hypercube by the embedding-in-book technique. An incomplete hypercube is a generalization of the hypercube in the sense that the number of nodes can be an arbitrary number. Embedding a graph in a book is to place nodes on the spine of a book and to draw the edges such that edges ...
Jywe-Fei Fang, Kuan-Chou Lai
openaire   +1 more source

Embedding Model Design for Producing Book Recommendation

International Conference on Information Management and Technology, 2019
Internet services often recommend contents to users in order to maintain the interaction. Recommendation system plays a major role to formulate and produce a series of recommendation based on users’ behavior. Surprisingly, user-generated scoring or known
R. Rahutomo, A. S. Perbangsa, Haryono Soeparno, Bens Pardamean   +3 more
semanticscholar   +1 more source

A Tight Subexponential-time Algorithm for Two-Page Book Embedding

International Colloquium on Automata, Languages and Programming
A book embedding of a graph is a drawing that maps vertices onto a line and edges to simple pairwise non-crossing curves drawn into pages, which are half-planes bounded by that line.
R. Ganian, Haiko Mueller, S. Ordyniak, Giacomo Paesani, Mateusz Rychlicki   +4 more
semanticscholar   +1 more source

Vertex Types in Book-Embeddings

SIAM Journal on Discrete Mathematics, 1989
A new measure of the complexity of a book-embedding of a simple undirected graph, the number of vertex types in the embedding, is studied. The type of a vertex $v $ in a p-page book-embedding is the $p \times 2$ matrix of nonnegative integers \[ \tau (v ) = \begin{pmatrix} L_1 & & R_1 \\ L_2 & & R_2 \\ & \vdots & \\ L_P & & {R_P } \end{pmatrix ...
Arnold L. Rosenberg, Jonathan F. Buss, Judson D. Knott   +2 more
openaire   +2 more sources

Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages

International Symposium on Computational Geometry, 2020
An embedding of a graph in a book, called book embedding, consists of a linear ordering of its vertices along the spine of the book and an assignment of its edges to the pages of the book, so that no two edges on the same page cross.
M. Bekos, G. D. Lozzo, Svenja M. Griesbach, M. Gronemann, F. Montecchiani, C. Raftopoulou   +5 more
semanticscholar   +1 more source

Structured Word Embedding for Low Memory Neural Network Language Model

Interspeech, 2018
Neural network language model (NN LM), such as long short term memory (LSTM) LM, has been increasingly popular due to its promising performance. However, the model size of an uncompressed NN LM is still too large to be used in embedded or portable ...
Kaiyu Shi, Kai Yu
semanticscholar   +1 more source

Book embeddings and crossing numbers

1995
The paper introduces the book crossing number problem which can be viewed as a variant of the well-known plane and surface crossing number problem or as a generalization of the book embedding problem. The book crossing number of a graph G is defined as the minimum number of edge crossings when the vertices of G are placed on the spine of a k-page book ...
Imrich Vrto, Farhad Shahrokhi, László A. Székely, Ondrej Sýkora   +3 more
openaire   +1 more source

Embedding graphs in books: a survey

IEE Proceedings E Computers and Digital Techniques, 1992
Embedding a graph in a book is an arrangement of vertices in a line along the spine of the book and edges on the pages in such a way that edges residing on the same page do not cross. Each graph has many different embeddings in books. The embedding with the minimum number of pages is optimum.
openaire   +2 more sources

A Designer Embedded Book Space Experiment

2021
The relationship between books and their readers are intimacy and personal. The texts are firsthand resources for readers experience personal journey while reading, and their own unparalleled inspiration. The reflection after reading could be represented in diverse fashions, most of them were written using words as reviews.
Tao-Tao Yu, Teng Wen Chang
openaire   +2 more sources

Book embedding of the k-ary hypercube

2008 First International Conference on the Applications of Digital Information and Web Technologies (ICADIWT), 2008
Graph embeddings play an important role in interconnection network and VLSI design. Determining the number of layers required to build a VLSI chip is just one of the many areas in which graph embeddings are used. A type of embedding that is helpful in determining the number of layers is a book embedding.
D. Hoelzeman, Said Bettayeb
openaire   +2 more sources