1772 search results - page 72 / 355 » Classifying Problems into Complexity Classes |
111
Voted
ICCV
2009
IEEE
14 years 10 months ago
2009
IEEE
Within the field of action recognition, features and descriptors are often engineered to be sparse and invariant to transformation. While sparsity makes the problem tractable, it ...
178
Voted
IWPEC
2010
Springer
14 years 10 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
110
Voted
SIAMJO
2010
14 years 11 months ago
2010
The imposition of general disjunctions of the form “πx ≤ π0 ∨ πx ≥ π0 + 1”, where π, π0 are integer valued, is a fundamental operation in both the branch-and-bound...
118
click to vote
MCS
2002
Springer
15 years 6 days ago
2002
Springer
Abstract. While a variety of multiple classifier systems have been studied since at least the late 1950's, this area came alive in the 90's with significant theoretical a...
112
click to vote
IADIS
2003
15 years 1 months ago
2003
The problem of hypertext classification deals with objects possessing more complex information structure than the plain text has. Present hypertext classification systems show the...