Find the peak of each islands in sparse matrix
I have a sparse matrix that contains several islands of unknown size. I would like to find the highest peak of each islands. Consider this matrix as an example:
Program to find Orthogonal Matrices
I have been trying to find orthogonal matrix of order n where first row will be given as 1/√n, 1/√n, …. n times.
Finding same numbers in a matrix
I have a question here and I am trying to find a solution of it. But I want to see some other opinions as well.
Matrices calculations on partial shape matching
I’m working in a shape recognition project where it is supposed for me to develop an application that receives two images: an original one and a sketch made by a user. I am supposed to detect contours of the two images and find the best match in the original image corresponding to the sketch made by the user.
Matrices calculations on partial shape matching
I’m working in a shape recognition project where it is supposed for me to develop an application that receives two images: an original one and a sketch made by a user. I am supposed to detect contours of the two images and find the best match in the original image corresponding to the sketch made by the user.
Transpose a matrix without a buffering one
How is it possible to transpose a MxN matrix without using a “buffering” matrix?
In the latter case it’s easy and quite the “classic” approach…
Transpose a matrix without a buffering one
How is it possible to transpose a MxN matrix without using a “buffering” matrix?
In the latter case it’s easy and quite the “classic” approach…
Transpose a matrix without a buffering one
How is it possible to transpose a MxN matrix without using a “buffering” matrix?
In the latter case it’s easy and quite the “classic” approach…
Matrix distribution to process grid
I need to write a program, which will perform LU-decomposition, etc. The problem is that I don’t know about the preferred way to distribute the loaded matrix from the root process to other processes. I’m able to create a simple algorithm for some situations, but I really need the solution which works for arbitrary number of processes.
Two dimensional matrix-like data type using lists and/or mutable lists
I am trying to think of an implementation of a two dimensional matrix-like data type.
Normally I would take an array of arrays but I’m bound to a relatively low language level which only provides lists and mutable lists, because this is part of (but not an exercise itself, I could simply use an inefficient solution) a software project at university. In this, we are only allowed to use a specific language level.
So of cause I could take a list of mutable lists and, in search of an item in row n and column m, get the m-th mutable list and go throught it until position n. But isn’t there a better solution than going through the whole list?