Akim - Google Blog Search |
| Posted: 08 Jan 2014 08:04 AM PST [unable to retrieve full-text content]Mikhail Andreev, Akim Kumok. We consider two quantities that measure complexity of binary strings: is defined as the minus logarithm of continuous a priori probability on the binary tree, and. denotes prefix complexity of a ... |
| You are subscribed to email updates from Akim - Google Blog Search To stop receiving these emails, you may unsubscribe now. | Email delivery powered by Google |
| Google Inc., 20 West Kinzie, Chicago IL USA 60610 | |
Tiada ulasan:
Catat Ulasan