摘要:
Present herein is a low memory and MIPS efficient technique for decoding Huffman codes using multi-stage, multi-bits lookup at different levels. A binary tree is cut at levels depending on the quotient of the number of existing nodes and the number of possible nodes.
摘要:
Methods and apparatus are disclosed for sending a notification message in accordance with a set of notification preferences. The notification message is sent upon the detection of an event or satisfaction of a condition with respect to a detected event. The set of notification preferences may indicate a desired notification medium via which the notification message is to be sent, a notification addressee to which the notification message is to be sent, and/or a notification timing preference indicating a date and/or time during which the notification is to be sent (or received).