Results 251 to 260 of about 92,904 (292)
A Practical Algorithm for Structure Embedding
, 2019 This paper presents an algorithm for the structure embedding problem: given two finite first-order structures over a common relational vocabulary, does there exist an injective homomorphism from one to the other? The structure embedding problem is NP-complete in the general case, but for monadic structures (each predicate has arity \(\le 1\)) we ...
Charlie Murphy, Zachary Kincaid
openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
A fast algorithm for matrix embedding steganography
Digital Signal Processing, 2014A fast algorithm for matrix embedding steganography is proposed in this paper. Matrix embedding encodes the cover image and the secret message with an error correction code and modifies the cover image according to the coding result. The modification to the cover image is the coset leader of the error correction code, and it is computationally complex ...
exaly +2 more sources
Discriminative Fisher Embedding Dictionary Learning Algorithm for Object Recognition
IEEE Transactions on Neural Networks and Learning Systems, 2020 Both interclass variances and intraclass similarities are crucial for improving the classification performance of discriminative dictionary learning (DDL) algorithms.
Zhengming Li, Zheng Zhang, Jie Qin
exaly +2 more sources
Improved algorithms for optimal embeddings
ACM Transactions on Algorithms, 2008In the last decade, the notion of metric embeddings with small distortion has received wide attention in the literature, with applications in combinatorial optimization, discrete mathematics, and bio-informatics. The notion of embedding is, given two metric spaces on the same number of points, to find a bijection that minimizes maximum Lipschitz and bi-
Nishanth Chandran +5 more
openaire +1 more source
Embedding optimisation algorithms with Mosel
Quarterly Journal of the Belgian, French and Italian Operations Research Societies, 2003zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Tito A. Ciriani +2 more
openaire +1 more source
Incomplete hypercubes: Algorithms and embeddings
The Journal of Supercomputing, 1994The hypercube, though a popular and versatile architecture, has a major drawback in that its size must be a power of two. In order to alleviate this drawback, Katseff [1988] defined theincomplete hypercube, which allows a hypercube-like architecture to be defined for any number of nodes.
Alfred J. Boals +2 more
openaire +1 more source
A randomized embedding algorithm for trees
Combinatorica, 2010In the authors' three related algorithms some vertex \(r\) of a given tree \(T\) is designated as the root, so, for every other vertex \(u\in T\) there is a unique path in \(T\) from \(r\) to \(u\); the neighbour of \(u\) on this path is called the parent of \(u\), and all remaining neighbours of \(u\) are the children of \(u\).
Benny Sudakov, Jan Vondrák
openaire +1 more source
Gradient-free Algorithms for Graph Embedding
2019 IEEE Congress on Evolutionary Computation (CEC), 2019Graph-based data are very ubiquitous in many real-world scenarios, and it is usually difficult to mine valuable information from the large scale graphs because of traditional sparse and high-dimension representations of nodes in the graphs. To address this issue, the graph embedding techniques which aim to map the nodes of the graph into a low ...
Qu, Liang, Shi, Yuhui
openaire +2 more sources
Parallel Algorithms and Subcube Embedding on a Hypercube
SIAM Journal on Scientific Computing, 1993The authors investigate embedding strategies for a hypercube multiprocessor for three fundamental algorithms: Gaussian elimination with partial pivoting, QR factorization with column pivoting and multiple least squares updating. Results are presented for the Intel iPSC/2 and iPSC/860 hypercube multiprocessors.
Eleanor Chu, Alan George
openaire +1 more source