Results 11 to 20 of about 19,522 (124)
Strong matching preclusion for augmented cubes
Theoretical Computer Science, 2013 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cheng, Eddie +3 more
openaire +4 more sources
Edge-independent spanning trees in augmented cubes
Theoretical Computer Science, 2017 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Wang, Y., Shen, H., Fan, J.
openaire +4 more sources
Omega-categories and chain complexes
, 2004 There are several ways to construct omega-categories from combinatorial objects such as pasting schemes or parity complexes. We make these constructions into a functor on a category of chain complexes with additional structure, which we call augmented ...
Steiner, Richard
core +3 more sources
On pointwise and weighted estimates for commutators of Calder\'on-Zygmund operators [PDF]
, 2017 In recent years, it has been well understood that a Calder\'on-Zygmund operator $T$ is pointwise controlled by a finite number of dyadic operators of a very simple structure (called the sparse operators).
Lerner, Andrei K. +2 more
core +2 more sources
Decomposition of augmented cubes into regular connected pancyclic subgraphs [PDF]
Journal of Parallel and Distributed Computing, 2020 In this paper, we consider the problem of decomposing the augmented cube $AQ_n$ into two spanning, regular, connected and pancyclic subgraphs. We prove that for $ n \geq 4$ and $ 2n - 1 = n_1 + n_2 $ with $ n_1, n_2 \geq 2,$ the augmented cube $ AQ_n$ can be decomposed into two spanning subgraphs $ H_1$ and $ H_2$ such that each $ H_i$ is $n_i$-regular
Kandekar, S. A. +2 more
openaire +2 more sources
Inferring and Executing Programs for Visual Reasoning
, 2017 Existing methods for visual reasoning attempt to directly map inputs to outputs using black-box architectures without explicitly modeling the underlying reasoning processes.
Fei-Fei, Li +6 more
core +1 more source
Variational approach to relaxed topological optimization: closed form solutions for structural problems in a sequential pseudo-time framework [PDF]
, 2019 The work explores a specific scenario for structural computational optimization based on the following elements: (a) a relaxed optimization setting considering the ersatz (bi-material) approximation, (b) a treatment based on a non-smoothed characteristic
Cante Terán, Juan Carlos +3 more
core +1 more source
A combinatorial model for the path fibration
, 2018 We introduce the abstract notion of a necklical set in order to describe a functorial combinatorial model of the path fibration over the geometric realization of a path connected simplicial set.
Rivera, Manuel, Saneblidze, Samson
core +1 more source
Goodwillie towers and chromatic homotopy: an overview [PDF]
, 2007 This paper is based on talks I gave in Nagoya and Kinosaki in August of 2003. I survey, from my own perspective, Goodwillie's work on towers associated to continuous functors between topological model categories, and then include a discussion of ...
Kuhn, Nicholas J
core +3 more sources
Maximum Induced Subgraph of an Augmented Cube
, 2014 Let maxζG(m) denote the maximum number of edges in a subgraph of graph G induced by m nodes. The n-dimensional augmented cube, denoted as AQn, a variation of the hypercube, possesses some properties superior to those of the hypercube. We study the cases when G is the augmented cube AQn.
Meng-Jou Chien +2 more
openaire +1 more source