8413 search results - page 340 / 1683 » Ordering Problem Subgoals |
167
click to vote
UAI
1996
15 years 8 months ago
1996
Many algorithms for processing probabilistic networks are dependent on the topological properties of the problem's structure. Such algorithmse.g., clustering, conditioning ar...
165
click to vote
INFORMATICALT
2007
15 years 6 months ago
2007
In this paper we propose a modified framework of support vector machines, called Oblique Support Vector Machines(OSVMs), to improve the capability of classification. The principl...
167
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
In this paper we propose a novel, scalable, clustering based Ordinal Regression formulation, which is an instance of a Second Order Cone Program (SOCP) with one Second Order Cone ...
200
click to vote
WEA
2010
Springer
16 years 1 months ago
2010
Springer
A tanglegram consists of a pair of (not necessarily binary) trees T1, T2 with leaf sets L1, L2. Additional edges, called tangles, may connect nodes in L1 with those in L2. The task...
154
click to vote
CSR
2007
Springer
16 years 23 days ago
2007
Springer
We revisit a well studied linear algebraic problem, computing the rank and determinant of matrices, in order to obtain completeness results for small complexity classes. In partic...