Preference learning is a challenging problem that involves the prediction of complex structures, such as weak or partial order relations, rather than single values. In the recent ...
Occlusion is one of the challenging problems in stereo. In this paper, we solve the problem in a segment-based style. Both images are segmented, and we propose a novel patchbased ...
Automatic human age estimation has considerable potential applications in human computer interaction and multimedia communication. However, the age estimation problem is challengi...
Guodong Guo, Yun Fu, Thomas S. Huang, Charles R. D...
Abstract. CrossingNumber is one of the most challenging algorithmic problems in topological graph theory, with applications to graph drawing and VLSI layout. No polynomial time con...
The exponential number of possible subgraphs makes the problem of frequent subgraph mining a challenge. Maximal frequent mining has triggered much interest since the size of the s...
Lini T. Thomas, Satyanarayana R. Valluri, Kamalaka...