6. The method of claim 5 , wherein the binary search tree comprises a plurality of decision nodes and a plurality of leaf nodes, each decision node associated with a context attribute, each leaf node associated with one or more parameter vectors provided in a sub-plurality of parameter vectors.
6. The method of claim 5 , wherein the binary search tree comprises a plurality of decision nodes and a plurality of leaf nodes, each decision node associated with a context attribute, each leaf node associated with one or more parameter vectors provided in a sub-plurality of parameter vectors. 7. The method of claim 6 , wherein at least one decision node contains a splitting context attribute, a splitting value, and references to a left successor node and a right successor node.