Or connect using:

Some changes have been made to LiveJournal, and we hope you enjoy them! As we continue to improve the site on a daily basis to make your experience here better and faster, we would greatly appreciate your feedback about these changes. Please let us know what we can do for you!

karinfromnosundMay 21 2009, 11:19:12 UTC 6 years ago

So the answer is: yes, go ahead.

rxvmMay 21 2009, 11:23:59 UTC 6 years ago

czarandyMay 21 2009, 12:45:49 UTC 6 years ago

In a streaming setting (where you can only read through the data in one direction, in order) you might describe O(f(n)) passes as required for some algorithm. You might also describe some distributed/network algorithm in terms of bits of communication.

danman3459May 21 2009, 13:51:30 UTC 6 years ago

czarandyMay 21 2009, 14:58:42 UTC 6 years ago

For example, the prime number theorem says that the density of primes grows like (1 + o(1))(n/ln(n)).

roadriverrailMay 21 2009, 17:50:20 UTC 6 years ago

(1) Calculate the packet arrival time for a given network and the necessary rate of media playback for a given profile (i.e. bitrate, quality, encoding,e tc).

(2) Put a Big-O on each

(3) From (2), put a Big-O on the amount of memory you'd need in your set top box to buffer, given a certain tolerance for loss of playback or dropped frames.

triprcwrote inalgorithms: ←(No Subject)cr4kwrote inalgorithms: →Finding the nearest in a sorted set of int to a given int