Results 271 to 280 of about 3,366,127 (326)
Some of the next articles are maybe not open access.
Embedding the incomplete hypercube in books
Information Processing Letters, 2005In 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, 2019Internet 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 +3 more
semanticscholar +1 more source
Vertex Types in Book-Embeddings
SIAM Journal on Discrete Mathematics, 1989A 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 +2 more
openaire +2 more sources
Structured Word Embedding for Low Memory Neural Network Language Model
Interspeech, 2018Neural 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 of Nonplanar Graphs with Small Faces in Few Pages
International Symposium on Computational Geometry, 2020An 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 +5 more
semanticscholar +1 more source
Embedding Graphs into a Three Page Book with O(m log n) Crossings of Edges over the Spine
SIAM Journal on Discrete Mathematics, 1999This paper studies the problem of embedding a graph G into a book with vertices on a line along the spine of the book and edges on the pages in such a way that no edge crosses another.
H. Enomoto, M. Miyauchi
semanticscholar +1 more source
Book embeddings and crossing numbers
1995The 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 +3 more
openaire +1 more source
The Living Code: Embedding Ethics into the Corporate DNA
, 2017A code is a measure for success: success as manager, employee, team and the organisation as a whole. Unfortunately, many codes are underutilized. Through practical tips and examples, this book demonstrates how to make full use of the potential of a code.
M. Kaptein
semanticscholar +1 more source
The Embedding Method for Electronic Structure
, 2016The embedding method is a powerful theoretical and computational technique that is relevant to a great many technologically and scientifically important problems.
J. Inglesfield
semanticscholar +1 more source
Embedding graphs in books: a survey
IEE Proceedings E Computers and Digital Techniques, 1992Embedding 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