Abstract. To prove or disprove the computational equivalence of solving the RSA problem and factoring integers is a longstanding open problem in cryptography. This paper provides s...
We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivo...
We consider the sequential portfolio investment problem. Building on results in signal processing, machine learning, and other areas, we use factor graphs to develop new universal...
Given a k-uniform hypergraph on n vertices, partitioned in k equal parts such that every hyperedge includes one vertex from each part, the k-Dimensional Matching problem asks wheth...
In the context of object recognition, it is useful to extract, from the images, efficient indexes that are insensitive to the illumination conditions, to the camera scale factor ...