This paper presents new algorithms for computing single source shortest paths (SSSPs) in a nearly acyclic directed graph G. The first part introduces higher-order decomposition. ...
We propose a new method for clustering based on finding maximum margin hyperplanes through data. By reformulating the problem in terms of the implied equivalence relation matrix, ...
Linli Xu, James Neufeld, Bryce Larson, Dale Schuur...
Good camera control and planning techniques in 3D computer games can give players deeper feelings about atmosphere of games. However, most modern computer games use fixed point-of...
In this paper, a discrimination and robusmess oriented adaptive learning procedure is proposed to deal with the task of syntactic ambiguity resolution. Owing to the problem of ins...
—Pose problem is a big challenge for applying face recognition technology under real world conditions. In this paper, appearance based approach was proposed to recognize face acr...
Hongzhou Zhang, Yongping Li, Lin Wang, Chengbo Wan...