Timeline for Find close pairs in very high dimensional space with sparse vectors
Current License: CC BY-SA 3.0
4 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 26, 2016 at 11:13 | comment | added | denis | 1) "this number will not be too big": the average column sum = average row sum = 1000. 2) floats ? the OP's features are binary 3) runtimes for 3 runs N, 2N, 4N would be interesting, would show if they're roughly $O(N^2)$. | |
| Sep 18, 2015 at 14:06 | history | edited | RUser4512 | CC BY-SA 3.0 |
added 412 characters in body
|
| Sep 18, 2015 at 13:56 | comment | added | Sycorax♦ | I don't entirely understand this approach -- this isn't because I disbelieve you, it's entirely due to my lack of familiarity with different strategies for representing data. Perhaps you could elaborate more on your what you cover in the first two paragraphs? | |
| Sep 18, 2015 at 13:45 | history | answered | RUser4512 | CC BY-SA 3.0 |