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...
Face recognition and many medical imaging applications require the computation of dense correspondence vector fields that match one surface with another. In brain imaging, surfac...
This paper is devoted to explore media correlation and media synchronization in a composite multimedia document, the so-called navigated hypermedia document in our language learni...
Starting in 2003, Drew University began a process to replace its manual account management procedures with an automated provisioning system based upon Novell technologies. Over th...
The present study explores potential usability gaps when users switch from a familiar to an unfamiliar mobile phone interface. A within-subject experiment was performed in which n...