Workshop paper
Automatic task slots assignment in Hadoop MapReduce
Kun Wang, Juwei Shi, et al.
PACT 2011
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
Conference paper
IBM TRECVID'08 high-level feature detection
Apostol Natsev, Wei Jiang, et al.
TRECVID 2008
Conference paper
Write amplification analysis in flash-based solid state drives
Xiao-Yu Hu, Evangelos Eleftheriou, et al.
Israeli SYSTOR 2009
Tianwen Qian, Jingjing Chen, et al.
IEEE TMM