Results 291 to 300 of about 3,644,444 (342)
Some of the next articles are maybe not open access.

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 ...
Jonathan F. Buss   +2 more
openaire   +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

Embedding the mesh in books

PACRIM. 2005 IEEE Pacific Rim Conference on Communications, Computers and signal Processing, 2005., 2005
In this paper, we study the linear layout problem of the rectangular mesh by the embedding-in-book technique. Embedding a graph in a book is to place nodes on the spine of a book and to draw the edges such that edges residing in a page do not cross. We propose a scheme to embed an h /spl times/ w rectangular mesh with two pages and book width Min(h,w ...
null Erh-Ying Yen   +4 more
openaire   +1 more source

Upward Topological Book Embeddings of DAGs [PDF]

open access: possibleSIAM Journal on Discrete Mathematics, 2011
Let G be a directed acyclic graph (DAG). An upward (k,h)-topological book embedding of G is an upward book embedding on k pages of a subdivision of G where every edge is replaced by a path having at most h+2 vertices. In this paper it is proved that every DAG with n vertices admits an upward (d+1, 2⌈logdn⌉-1)-topological book embedding, where d is any ...
DI GIACOMO, Emilio   +2 more
openaire   +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 ...
Farhad Shahrokhi   +3 more
openaire   +1 more source

Lefschetz Open Book Embeddings of 4-Manifolds

Studia Scientiarum Mathematicarum Hungarica, 2022
In this article, we define the notion of a generalized open book of a n-manifold over the k−sphere Sk , k < n. We discuss Lefschetz open book embeddings of Lefschetz open books of closed oriented 4-manifolds into the trivial open book over S2 of the 7−sphere S7 .
Abhijeet Ghanwat   +2 more
openaire   +1 more source

Embedding the incomplete hypercube in books

Information Processing Letters, 2005
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Fang, Jywe-Fei, Lai, Kuan-Chou
openaire   +2 more sources

Book review: Designing Embedded Hardware

ACM SIGPLAN Notices, 2006
My last column finished up a two-part retrospective to recap the first ten years of ACM Sigplan Notices Forth Report . If you have access to back issues of Sigplan or ACM Portal , you must have enjoyed the review that much more. I hope so.
openaire   +1 more source

A survey on book-embedding of planar graphs

Frontiers of Mathematics in China, 2022
Xiaxia Guan   +3 more
semanticscholar   +1 more source

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   +1 more source

Home - About - Disclaimer - Privacy