2192 search results - page 154 / 439 » Algorithms for Challenging Motif Problems |
CVPR
2011
IEEE
13 years 3 days ago
2011
IEEE
This paper addresses the problem of automatic reconstruction of a 3D relief from a line drawing on top of a given base object. Reconstruction is challenging due to four reasons â€...
CORR
2008
Springer
13 years 8 months ago
2008
Springer
Abstract. We consider the minimum spanning tree problem in a setting where information about the edge weights of the given graph is uncertain. Initially, for each edge e of the gra...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Normalized Cut is a widely used technique for solving a
variety of problems. Although finding the optimal normalized
cut has proven to be NP-hard, spectral relaxations can
be ap...
Publication
Recognizing multiple interleaved activities in a video requires implicitly partitioning the detections for each activity. Furthermore, constraints between activities are important ...
WWW
2005
ACM
14 years 9 months ago
2005
ACM
By far, the support vector machines (SVM) achieve the state-of-theart performance for the text classification (TC) tasks. Due to the complexity of the TC problems, it becomes a ch...