Editing User:Dspies
Jump to navigation
Jump to search
The edit can be undone. Please check the comparison below to verify that this is what you want to do, and then publish the changes below to finish undoing the edit.
Latest revision | Your text | ||
Line 112: | Line 112: | ||
== Y: Your task == | == Y: Your task == | ||
* Did you select a task from our list of proposals and ideas? | * Did you select a task from our list of proposals and ideas? | ||
I kind of had my own idea, but it's closely related to one of the tasks listed. | |||
** If yes, what task did you choose? Please describe what part of it you especially want to focus on if you can already provide this information. | ** If yes, what task did you choose? Please describe what part of it you especially want to focus on if you can already provide this information. | ||
The Sparse Matrices Project: http://wiki.octave.org/Projects#Sparse_Matrices | The Sparse Matrices Project: http://wiki.octave.org/Projects#Sparse_Matrices | ||
I want to help improve Sparse Matrix support. | I want to help improve Sparse Matrix support. But I have a specific goal in mind, not just generally filling arbitrary gaps here and there. (see below) | ||
Particularly, I | ** If you apply for a task you have added yourself instead, please describe this task, its scope and people you already talked to concerning it. What field of tasks did you miss on the list? | ||
Particularly, I want to build a sparse matrix library tuned towards graph operations. I think that people often underestimate how many complex graph operations are possible with sparse matrices. In many cases, doing something like a breadth-first search can be equivalent to an operation which is almost just a matrix multiply.<br /> | |||
On the mailing list, I gave an example of a program that takes an undirected graph and finds the set of all maximal cliques. As I've mentioned, I've done a lot with this sort of thing, but constantly find myself working around gaps or bugs. I want to try to fill those gaps and build this graph library on top of it. <br/> | On the mailing list, I gave an example of a program that takes an undirected graph and finds the set of all maximal cliques. As I've mentioned, I've done a lot with this sort of thing, but constantly find myself working around gaps or bugs. I want to try to fill those gaps and build this graph library on top of it. <br/> | ||
UPDATE: After some discussion on the mailing list, one project | UPDATE: After some discussion on the mailing list, one project someone suggested was just to get Octave Sparse-Matrix indexing working properly. I'd be happy just working on this. It seems feasible since sparse column arrays are already stored in compressed format (and indexing generally requires converting back and forth between matrix and column format, but there shouldn't be any need to use row vectors) | ||
* Please provide a rough estimated timeline for your work on the task. | * Please provide a rough estimated timeline for your work on the task. | ||
I don't know how to estimate this. | |||
[[Category: Summer of Code]] | [[Category: Summer of Code]] | ||