Timeline for Fast Bourgain embedding (or similar embeddings)?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 5, 2020 at 19:23 | history | edited | user6671 | CC BY-SA 4.0 |
added 73 characters in body
|
| Jan 5, 2020 at 18:08 | vote | accept | CommunityBot | ||
| Jan 5, 2020 at 1:58 | answer | added | Vladimir Zolotov | timeline score: 4 | |
| Sep 9, 2019 at 5:52 | history | edited | user6671 | CC BY-SA 4.0 |
added 61 characters in body; edited title
|
| Sep 6, 2019 at 4:50 | comment | added | user6671 | @asd : Thanks for the hint. I will have a look. One question: You suggest to use FJLT as an approximate search algorithm in Bourgain embedding? | |
| Sep 5, 2019 at 21:50 | comment | added | asd | Maybe look at the "Fast Johnson Lindenstrauss Transform", specifically this paper: Ailon, Nir; Chazelle, Bernard (2006). "Approximate nearest neighbors and the fast Johnson–Lindenstrauss transform". Proceedings of the 38th Annual ACM Symposium on Theory of Computing. | |
| Sep 5, 2019 at 21:15 | history | edited | YCor | CC BY-SA 4.0 |
edited tags
|
| Sep 5, 2019 at 20:03 | history | edited | user6671 |
edited tags
|
|
| Sep 5, 2019 at 13:59 | history | asked | user6671 | CC BY-SA 4.0 |