Timeline for Computation Complexity of stream algorithm
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jan 25, 2018 at 18:53 | vote | accept | Mark | ||
| Jan 25, 2018 at 18:33 | answer | added | D.W.♦ | timeline score: 2 | |
| Jan 25, 2018 at 18:30 | comment | added | D.W.♦ | I can't understand what exactly your question is. I suggest you do some background reading about streaming algorithms and online algorithms (e.g., en.wikipedia.org/wiki/Streaming_algorithm) and then see if you can formulate a more specific question. Those fields certainly measure the running time of algorithms. | |
| Jan 25, 2018 at 16:07 | comment | added | Curious_Dim | In final analysis, your algorithm computation complexity depends on what? What is your computation complexity per new arrived item? This will give you the time complexity per N-items arrived till now or in total, if this is the maximum stream length. (It is just a multiplication) | |
| Jan 25, 2018 at 15:54 | review | First posts | |||
| Jan 25, 2018 at 16:22 | |||||
| Jan 25, 2018 at 15:53 | history | asked | Mark | CC BY-SA 3.0 |