Results 21 to 30 of about 3,550,540 (296)
Aligning Books and Movies: Towards Story-Like Visual Explanations by Watching Movies and Reading Books [PDF]
IEEE International Conference on Computer Vision, 2015 Books are a rich source of both fine-grained information, how a character, an object or a scene looks like, as well as high-level semantics, what someone is thinking, feeling and how these states evolve through a story.
Fidler, Sanja +6 more
core +5 more sources
Improved book-embeddings of incomplete hypercubes
Discrete Applied Mathematics, 2009 AbstractIn this paper, we show that any incomplete hypercube with, at most, 2n+2n−1+2n−2 vertices can be embedded in n−1 pages for all n≥4. For the case n≥4, this result improves Fang and Lai’s result that any incomplete hypercube with, at most, 2n+2n−1 vertices can be embedded in n−1 pages for all n≥2.Besides this, we show that the result can be ...
Toru Hasunuma
openaire +2 more sources
Two-Page Book Embeddings of 4-Planar Graphs [PDF]
Algorithmica, 2014 Back in the Eighties, Heath showed that every 3-planar graph is subhamiltonian and asked whether this result can be extended to a class of graphs of degree greater than three.
Bekos, Michael A. +2 more
core +7 more sources
Book Embeddings of Graph Products
, 2020 A $k$-stack layout (also called a $k$-page book embedding) of a graph consists of a total order of the vertices, and a partition of the edges into $k$ sets of non-crossing edges with respect to the vertex order. The stack number (book thickness, page number) of a graph is the minimum $k$ such that it admits a $k$-stack layout.
Sergey Pupyrev
openaire +4 more sources
Early Childhood Education Papers, 2020 One of the character problems in early childhood is the lack of ability to be responsible, communicate, and cooperate. These three main behaviors are characteristics of leadership behavior.
Sinthia Nurul Fitri, Edi Waluyo
doaj +3 more sources
A Tight Subexponential-time Algorithm for Two-Page Book Embedding [PDF]
International Colloquium on Automata, Languages and ProgrammingA 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.
Robert Ganian +4 more
openalex +2 more sources
Book Review: Embeddings in manifolds [PDF]
Bulletin of the American Mathematical Society, 2011 J. W. Cannon
openaire +4 more sources
The Book Embedding Problem from a SAT-Solving Perspective
International Symposium Graph Drawing and Network Visualization, 2015 Michael A. Bekos +2 more
openalex +2 more sources
Embedded contact homology and open book decompositions
, 2010 This is the first of a series of papers devoted to proving the equivalence of Heegaard Floer homology and embedded contact homology (abbreviated ECH). In this paper we prove that, given a closed, oriented, contact $3$-manifold, there is an equivalence between ECH of the closed $3$-manifold and a version of ECH, defined on the complement of the binding ...
Colin, Vincent +2 more
openaire +4 more sources