Recalculate upper bound before giving up on prune. This is done by Hamerly's algorithm and we obtain minor speedup as a result.
Recalculate upper bound before giving up on prune. This is done by Hamerly's algorithm and we obtain minor speedup as a result.

palashahuja/mlpack,darcyliu/mlpack,chenmoshushi/mlpack,ranjan1990/mlpack,ajjl/mlpack,palashahuja/mlpack,datachand/mlpack,thirdwing/mlpack,trungda/mlpack,Azizou/mlpack,palashahuja/mlpack,stereomatchingkiss/mlpack,darcyliu/mlpack,minhpqn/mlpack,lezorich/mlpack,ersanliqiao/mlpack,bmswgnp/mlpack,trungda/mlpack,BookChan/mlpack,ersanliqiao/mlpack,bmswgnp/mlpack,thirdwing/mlpack,theranger/mlpack,datachand/mlpack,thirdwing/mlpack,chenmoshushi/mlpack,BookChan/mlpack,ranjan1990/mlpack,ranjan1990/mlpack,stereomatchingkiss/mlpack,minhpqn/mlpack,trungda/mlpack,chenmoshushi/mlpack,theranger/mlpack,erubboli/mlpack,erubboli/mlpack,theranger/mlpack,ersanliqiao/mlpack,minhpqn/mlpack,lezorich/mlpack,bmswgnp/mlpack,datachand/mlpack,darcyliu/mlpack,ajjl/mlpack,ajjl/mlpack,BookChan/mlpack,lezorich/mlpack,Azizou/mlpack,stereomatchingkiss/mlpack,erubboli/mlpack,Azizou/mlpack