Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Use Euclidian distance in a virtual matrix #22

Closed
wants to merge 7 commits into from

Conversation

frodrigo
Copy link
Contributor

I try to use euclidean distance in place of matrix. Idea is test how big instance vroom can resolve, without having to store a such large matrix in memory.

It's just conceptual, it's not working (not even compiling)

@jcoupey
Copy link
Collaborator

jcoupey commented Jan 23, 2016

My guess is that the computing times will become unreasonably high before storing the matrix will actually become a problem but I really didn't investigate this. What amount of locations do you have in mind when you say "large"?

On the other hand, re-computing the euclidean distance each time a distance is required (that's very often) will overload the computing time itself.

@frodrigo
Copy link
Contributor Author

I was thinking about starting from 30 000 up to 200 000 and if still doable up to million.

Nobody live will be saved with this try, nor man put on Mars, it's just for fun.

@jcoupey
Copy link
Collaborator

jcoupey commented Jan 23, 2016

Sounds fun to me too. ;-) Besides, pushing the limits is often a great way to spot improvements.

As this may not be limited to matrix impact on memory, I merged your commit in a dedicated branch experimental_huge_instances to play around freely without messing up the develop branch. Also set-up issue #23 to further discuss this.

@jcoupey jcoupey mentioned this pull request Jan 24, 2016
@jcoupey jcoupey closed this Feb 1, 2016
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

None yet

2 participants