搜索结果: 1-15 共查到“Factorization”相关记录102条 . 查询时间(0.072 秒)
Academy of Mathematics and Systems Science, CAS Colloquia & Seminars：Wormholes, Berry phases and factorization
虫洞 浆果阶段 因子分解 编码拓扑信息
2023/5/15
I shall start by reviewing the connection between the wormholes and entanglement in the context of AdS/CFT. I shall then show how the Berry phase, a geometrical phase encoding information about the to...
ENDMEMBER EXTRACTION OF HIGHLY MIXED DATA USING L1 SPARSITY-CONSTRAINED MULTILAYER NONNEGATIVE MATRIX FACTORIZATION
Hyperspectral Imagery Nonnegative Matrix Factorization Multilayer Nonnegative Matrix Factorization Sparsity Constraint Endmember Extraction
2018/5/11
Due to the limited spatial resolution of remote hyperspectral sensors, pixels are usually highly mixed in the hyperspectral images. Endmember extraction refers to the process identifying the pure endm...
2017年计算机视觉矩阵和张量因子分解方法研讨会（Workshop on Matrix and Tensor Factorization Methods in Computer Vision）
2017年 计算机视觉矩阵和张量因子分解方法 研讨会
2017/9/21
Matrix and tensor factorizations have a long history in machine learning. Being able to recover latent factors in the data and flexible enough to accommodate a large set of constraints and regularizat...
On Improving Integer Factorization and Discrete Logarithm Computation using Partial Triangulation
RSA factoring discrete logarithm problem
2017/8/8
The number field sieve is the best-known algorithm for factoring integers and solving the discrete logarithm problem in prime fields. In this paper, we present some new improvements to various steps o...
Bones et al. showed at Crypto 99 that moduli of the form N=prq can be factored in polynomial time when r≥logp. Their algorithm is based on Coppersmith's technique for finding small roots of polynomial...
Efficient Privacy-Preserving Matrix Factorization via Fully Homomorphic Encryption
homomorphic encryption matrix factorization gradient descent
2016/3/4
Recommendation systems become popular in our daily life. It is well known that the more
the release of users’ personal data, the better the quality of recommendation. However, such
services raise se...
FFS Factory: Adapting Coppersmith's "Factorization Factory" to the Function Field Sieve
Discrete logarithm Function field sieve Cryptanalysis
2016/1/9
In 1993, Coppersmith introduced the “factorization factory”
approach as a means to speed up the Number Field Sieve algorithm
(NFS) when factoring batches of integers of similar size: at the expense
...
Mersenne factorization factory
Mersenne numbers factorization factory special number field sieve
2016/1/7
We present new factors of seventeen Mersenne numbers, obtained using a variant of
the special number field sieve where sieving on the algebraic side is shared among the numbers.
It reduced the overa...
A Simple and Improved Algorithm for Integer Factorization with Implicit Hints
public-key cryptography / factoring
2016/1/6
Given two integers N1=p1q1 and N2=p2q2 with α-bit primes q1,q2, suppose that the t least significant bits of p1 and p2 are equal. May and Ritzenhofen (PKC 2009) developed a factoring algorithm for N1,...
This note is related to Theorem 1 of the ICA-BSS Conference’paper “AR Processes and Sources can be Reconstructed from Degenerate Mixtures” [1]. Here we study further the uniqueness of the decompositio...
We describe the application of the graph-theoretic property known as treewidth to the problem of
finding efficient parsing algorithms. This method, similar to the junction tree algorithm ...
Complexity,Parsing,and Factorization of Tree-Local Multi-Component Tree-Adjoining Grammar
Complexity Parsing Factorization Tree-Local Multi-Component Tree-Adjoining Grammar
2015/9/8
Tree-Local Multi-Component Tree-Adjoining Grammar (TL-MCTAG) is an appealing formalism for natural language representation because it arguably allows the encapsulation of the appropriate domain of loc...
When Does Non-Negative Matrix Factorization Give a Correct Decomposition into Parts?
Non-Negative Matrix Factorization Parts
2015/8/21
We interpret non-negative matrix factorization geometrically, as the
problem of finding a simplicial cone which contains a cloud of data
points and which is contained in the positive orthant.
Grouping tasks and data display items via the non-negative matrix factorization
Grouping tasks non-negative matrix factorization
2015/8/21
Analyzing work functions and the IO variables they
need is an important component of designing and evaluating
complex systems. We develop a biclustering method for jointly
grouping work functions a...
FIR filter design via spectral factorization and convex optimization
Finite impulse response filter filter coefficient variables spectral decomposition linear and nonlinear convex programming
2015/8/11
We consider the design of finite impulse response (FIR) filters subject to upper and lower bounds on the frequency response magnitude. The associated optimization problems, with the filter coefficient...