Sciweavers

5692 search results - page 159 / 1139
» Challenges and Unsolved Problems
Sort
View
115
Voted
AI
2008
Springer
15 years 1 months ago
Label ranking by learning pairwise preferences
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 ...
Eyke Hüllermeier, Johannes Fürnkranz, We...
91
Voted
ICCV
2005
IEEE
16 years 3 months ago
A Symmetric Patch-Based Correspondence Model for Occlusion Handling
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 ...
Yi Deng, Qiong Yang, Xueyin Lin, Xiaoou Tang
96
Voted
WACV
2008
IEEE
15 years 7 months ago
Locally Adjusted Robust Regression for Human Age Estimation
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...
86
Voted
ISAAC
2007
Springer
124views Algorithms» more  ISAAC 2007»
15 years 7 months ago
Approximating the Crossing Number of Toroidal Graphs
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...
Petr Hlinený, Gelasio Salazar
ICDM
2006
IEEE
184views Data Mining» more  ICDM 2006»
15 years 7 months ago
MARGIN: Maximal Frequent Subgraph Mining
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...