LAUSR

An algorithm to compute a presentation of pushforward modules

Sign Up to like & get
recommendations!
1 Published in 2017 at "Topology and its Applications"

DOI: 10.1016/j.topol.2017.11.025

Abstract: Abstract We describe an algorithm to compute a presentation of the pushforward module f ⁎ O X for a finite map germ f : X → ( C n + 1 , 0 ) ,… read more here.

Keywords: presentation pushforward; pushforward modules; compute presentation; algorithm compute ... See more keywords

An efficient algorithm to compute the X-ray transform

Sign Up to like & get
recommendations!
1 Published in 2021 at "International Journal of Computer Mathematics"

DOI: 10.1080/00207160.2021.1969017

Abstract: We propose a new algorithm to compute the X-ray transform of an image represented by unit (pixel/voxel) basis functions. The fundamental issue is equivalently calculating the intersection lengths of the ray with associated units. For… read more here.

Keywords: ray transform; ray; compute ray; algorithm compute ... See more keywords

An Iterative Coordinate Descent Algorithm to Compute Sparse Low-Rank Approximations

Sign Up to like & get
recommendations!
2 Published in 2022 at "IEEE Signal Processing Letters"

DOI: 10.1109/lsp.2021.3132276

Abstract: In this paper, we describe a new algorithm to build a few sparse principal components from a given data matrix. Our approach does not explicitly create the covariance matrix of the data and can be… read more here.

Keywords: principal components; iterative coordinate; algorithm compute; descent algorithm ... See more keywords

An Efficient Algorithm to Compute a Quantum Probability Space

Sign Up to like & get
recommendations!
1 Published in 2019 at "IEEE Transactions on Knowledge and Data Engineering"

DOI: 10.1109/tkde.2018.2863709

Abstract: Learning algorithms based on probability organize the observed data in subsets corresponding to binary variables. In this paper, we address the problem of estimating one probability space given a set of observed data about $n$n… read more here.

Keywords: probability space; algorithm compute; efficient algorithm; probability ... See more keywords

Efficient algorithm to compute Markov transitional probabilities for a desired PageRank

Sign Up to like & get
recommendations!
0 Published in 2020 at "EPJ Data Science"

DOI: 10.1140/epjds/s13688-020-00240-z

Abstract: We propose an efficient algorithm to learn the transition probabilities of a Markov chain in a way that its weighted PageRank scores meet some predefined target values. Our algorithm does not require any additional information… read more here.

Keywords: markov transitional; desired pagerank; efficient algorithm; algorithm compute ... See more keywords