W06-0118 | data is segmented by the forward | shortest matching | algo - rithm . After this initial |
P03-2008 | is an operation for finding the | shortest matching | . A set of non-nested extents |
W13-2517 | establishing constant lookup time for | shortest matching | URL strings .2 3 . The language |
W06-0118 | the training data , a forward | shortest matching | is used to get the sequence of |