Conference paper
Uncovering the Hidden Cost of Model Compression
Diganta Misra, Muawiz Chaudhary, et al.
CVPRW 2024
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
R.A. Gopinath, Markus Lang, et al.
ICIP 1994
Conference paper
Anonymous and revocable fingerprint recognition
Faisal Farooq, Ruud M. Bolle, et al.
CVPR 2007
Conference paper
EPAComp: An Architectural Model for EPA Composition
Luís Henrique Neves Villaça, Sean Wolfgand Matsui Siqueira, et al.
SBSI 2023