The min-sum k-clustering problem is to partition a metric space (P, d) into k clusters C1, . . . , Ck ⊆ P such that k i=1 p,q∈Ci d(p, q) is minimized. We show the first effi...
alization is a combination of abstract generated forms and found imagery. The frequency, amplitude, and percentage differences between samples of incoming data are mapped to forms ...
Wireless systems that form a body-area network must be made small and low power without sacrificing performance. To achieve high-throughput communication in low-cost wireless bod...
An optimized scheme of multiplexing coded mesh and texture data to facilitate progressive transmission of 3D textured models is proposed in this work. The mesh and texture data of...
Network management applications require accurate estimates of a wide range of flow-level traffic metrics. Given the inadequacy of current packet-sampling-based solutions, several ...