Conference paper
Unified solution for procurement integration and B2B stores
Trieu C. Chieu, Shiwa S. Fu, et al.
ICEC 2003
Paper
Minimum area circumscribing Polygons
Abstract
We show that the smallest k-gon circumscribing a convex n-gon can be computed in O(n2 log n log k) time. © 1985 Springer-Verlag.
Related
Workshop paper
Automatic task slots assignment in Hadoop MapReduce
Kun Wang, Juwei Shi, et al.
PACT 2011
Conference paper
On efficient Viterbi decoding for hidden semi-Markov models
Ritendra Datta, Jianying Hu, et al.
ICPR 2008
Girmaw Abebe Tadesse, Oliver Bent, et al.
IEEE SPM