Consider an edge-weighted tree T = (V, E, w : E R+ ), in which a subset R of the nodes (called the required nodes) are colored red and the remaining nodes in S = V \R are colored ...
This paper presents a method to automatically locate facial feature points under large variations in pose, illumination and facial expressions. First we propose a method to calcul...
Longbin Chen, Lei Zhang, HongJiang Zhang, Mohamed ...
Given a dataset P, a k-means query returns k points in space (called centers), such that the average squared distance between each point in P and its nearest center is minimized. S...
Zhenjie Zhang, Yin Yang, Anthony K. H. Tung, Dimit...
Several different uses of Newton's method in connection with the Fundamental Theorem of Algebra are pointed out. Theoretical subdivision schemes have been combined with the n...
Private approximation of search problems deals with finding approximate solutions to search problems while disclosing as little information as possible. The focus of this work is ...