Timeline for Reconstructing set of points from one-dimensional images
Current License: CC BY-SA 3.0
14 events
when toggle format | what | by | license | comment | |
---|---|---|---|---|---|
May 9, 2014 at 10:29 | comment | added | user45183 | Thank you very much for your efforts. I am now going through your proof. I am wondering whether the computation of the set $S$ can be made efficient, e.g. by giving an "easier" proof for the multiset-case only. To this end, mathoverflow.net/questions/165534/… might also be interesting to you. Thank you very much again. | |
May 9, 2014 at 10:23 | vote | accept | CommunityBot | ||
May 8, 2014 at 15:35 | comment | added | Liviu Nicolaescu | I've updated my answer and I explain how to deal with multisets. | |
May 8, 2014 at 15:35 | history | edited | Liviu Nicolaescu | CC BY-SA 3.0 |
added 1425 characters in body
|
May 8, 2014 at 13:51 | comment | added | Liviu Nicolaescu | Yes, it makes the problem easier. If you know $L(S)$ aa multi-set, then you know a collection of points with some multiplicities. In my proof I do not assume that these multiplicities are known, i.e., I assume a lot less. The method I described can also be used when the set $S$ itself is a multiset. In a few hours will add an update to my answer. | |
May 8, 2014 at 12:41 | comment | added | user45183 | Dear Prof. Nicolaescu, thank you very much for your answer. It seems that there was a slight misunderstanding in my question. You wrote that in B that $L(S)$ has $m \le N$ elements. Actually I want to also take into account multiplicities, i.e. view $L(S)$ not as a set but as a multiset. Does this make the problem easier? Can your solution still be applied? | |
May 8, 2014 at 12:18 | vote | accept | CommunityBot | ||
May 8, 2014 at 12:42 | |||||
Apr 17, 2014 at 13:18 | history | edited | Liviu Nicolaescu | CC BY-SA 3.0 |
added 247 characters in body
|
Apr 17, 2014 at 12:33 | history | edited | Liviu Nicolaescu | CC BY-SA 3.0 |
added 303 characters in body
|
Apr 16, 2014 at 19:05 | history | edited | Liviu Nicolaescu | CC BY-SA 3.0 |
added 929 characters in body
|
Apr 16, 2014 at 19:00 | history | edited | Liviu Nicolaescu | CC BY-SA 3.0 |
added 929 characters in body
|
Apr 16, 2014 at 18:37 | history | edited | Liviu Nicolaescu | CC BY-SA 3.0 |
added 99 characters in body
|
Apr 16, 2014 at 17:34 | history | edited | Liviu Nicolaescu | CC BY-SA 3.0 |
added 53 characters in body
|
Apr 16, 2014 at 17:28 | history | answered | Liviu Nicolaescu | CC BY-SA 3.0 |