Results 41 to 50 of about 6,473,960 (319)
Incremental Locally Linear Embedding Algorithm [PDF]
A number of manifold learning algorithms have been recently proposed, including locally linear embedding (LLE). These algorithms not only merely reduce data dimensionality, but also attempt to discover a true low dimensional structure of the data. The common feature of the most of these algorithms is that they operate in a batch or offline mode. Hence,
Olga Kouropteva +2 more
openaire +1 more source
Reversible Data Hiding Algorithm in Encrypted Domain Based on Image Interpolation
This study proposes a large capacity, reversible, and separable algorithm based on adaptive embedding to address the issues plaguing reversible data hiding in the encrypted images (RDH-EI) algorithms, such as reversibility, low embedding rate, and ...
Siyao Zhong, Yu Lu, Xiangguang Xiong
doaj +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
k-server via multiscale entropic regularization
We present an $O((\log k)^2)$-competitive randomized algorithm for the $k$-server problem on hierarchically separated trees (HSTs). This is the first $o(k)$-competitive randomized algorithm for which the competitive ratio is independent of the size of ...
Bubeck, Sebastien +4 more
core +1 more source
Fiber-Wireless Network Virtual Resource Embedding Method Based on Load Balancing and Priority
Network virtualization is becoming one of the most promising ways to solve resource solidification problem of fiber-wireless access networks. To fully utilize substrate resources, a virtual resource embedding method including three sub-mechanisms is ...
Siya Xu +3 more
doaj +1 more source
Optimal Embedding of Functions for In-Network Computation: Complexity Analysis and Algorithms
We consider optimal distributed computation of a given function of distributed data. The input (data) nodes and the sink node that receives the function form a connected network that is described by an undirected weighted network graph.
Limaye, Nutan +2 more
core +1 more source
Small grid embeddings of 3-polytopes [PDF]
We introduce an algorithm that embeds a given 3-connected planar graph as a convex 3-polytope with integer coordinates. The size of the coordinates is bounded by $O(2^{7.55n})=O(188^{n})$.
A. Ribó Mor +35 more
core +3 more sources
An algorithm for embedding oversubscribed virtual data center
Predictable network performance is critical for cloud applications and can be achieved by providing tenants a dedicated virtual data center (VDC) with bandwidth guarantee.The embedding problem of oversubscribed data center in physical data center network
Chukun LU, Fangfang YAN, Dong LI
doaj +2 more sources
Generative linguistic steganography aims to produce texts that remain both perceptually and statistically imperceptible. The existing embedding algorithms often suffer from imbalanced candidate selection, where high-probability words are overlooked and ...
Yingquan Chen +7 more
doaj +1 more source
Network virtualization (NV) is one crucial attribute for the next-generation network. Virtual network embedding (VNE) is known to be the resource allocation problem in NV content.
Haotong Cao +5 more
semanticscholar +1 more source

