Results 21 to 30 of about 26,540 (300)

Embedding almost-complex manifolds in almost-complex euclidean spaces [PDF]

open access: yes, 2011
We show that any compact almost-complex manifold (M, J) of complex dimension m can be pseudo-holomorphically embedded in R6m equipped with a suitable almost-complex structure
Antonio J. Di Scala   +6 more
core   +1 more source

Greedy routing and virtual coordinates for future networks [PDF]

open access: yes, 2012
At the core of the Internet, routers are continuously struggling with ever-growing routing and forwarding tables. Although hardware advances do accommodate such a growth, we anticipate new requirements e.g.
Bouabene, Ghazi
core   +1 more source

Quantifying soil complexity using network models of soil porous structure [PDF]

open access: yesNonlinear Processes in Geophysics, 2013
This paper describes an investigation into the properties of spatially embedded complex networks representing the porous architecture of soil systems. We suggest an approach to quantify the complexity of soil pore structure based on the node-node link ...
M. Samec   +6 more
doaj   +1 more source

Discrete embedding for attributed graphs

open access: yes, 2022
Attributed graphs refer to graphs where both node links and node attributes are observable for analysis. Attributed graph embedding enables joint representation learning of node links and node attributes.
Wang, H   +9 more
core   +1 more source

Weakly compact embedding of non-commutative symmetric spaces [PDF]

open access: yesE-Journal of Analysis and Applied Mathematics
In this paper, we prove that the embeddings of certain well-known symmetric spaces are weakly compact. Our main results concern noncommutative Lorentz and Marcinkiewicz spaces on finite von Neumann algebras.
Olga S. Sadovskaya
doaj   +1 more source

Task-Optimized Word Embeddings for Text Classification Representations

open access: yesFrontiers in Applied Mathematics and Statistics, 2020
Word embeddings have introduced a compact and efficient way of representing text for further downstream natural language processing (NLP) tasks. Most word embedding algorithms are optimized at the word level.
Sukrat Gupta   +3 more
doaj   +1 more source

Radial solutions of inhomogeneous fourth order elliptic equations and weighted Sobolev embeddings

open access: yesAdvances in Nonlinear Analysis, 2015
We deal with a class of inhomogeneous elliptic problems involving the biharmonic operator Δ2u + V(|x|)|u|q-2u = Q(|x|)f(u), u ∈ D02,2(ℝN), where Δ2 is the biharmonic operator and V, Q are singular continuous functions.
Demarque Reginaldo, Miyagaki Olimpio H.
doaj   +1 more source

Category-Oriented Self-Learning Graph Embedding for Efficient Image Compact Representation

open access: yes, 2021
As one of the ways to acquire efficient image compact representation, graph embedding (GE) based manifold learning has been widely developed over the last two decades.
Liangchen Hu (11277996)
core   +1 more source

Sharpened Adams Inequality and Ground State Solutions to the Bi-Laplacian Equation in ℝ4

open access: yesAdvanced Nonlinear Studies, 2018
In this paper, we establish a sharp concentration-compactness principle associated with the singular Adams inequality on the second-order Sobolev spaces in ℝ4{\mathbb{R}^{4}}.
Chen Lu   +3 more
doaj   +1 more source

THz Characterization and Modeling of SiGe HBTs: Review (Invited)

open access: yesIEEE Journal of the Electron Devices Society, 2020
This article presents a state-of-art review of on-wafer S-parameter characterization of THz silicon transistors for compact modelling purpose. After, a brief review of calibration/de-embedding techniques, the paper focuses on the on-wafer calibration ...
Sebastien Fregonese   +5 more
doaj   +1 more source

Home - About - Disclaimer - Privacy