383 search results - page 63 / 77 » A new infeasible interior-point algorithm for linear program... |
123
Voted
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
We consider two natural generalizations of the notion of transversal to a finite hypergraph, arising in data-mining and machine learning, the so called multiple and partial transve...
146
Voted
ICML
2009
IEEE
16 years 4 months ago
2009
IEEE
Previous studies of Non-Parametric Kernel (NPK) learning usually reduce to solving some Semi-Definite Programming (SDP) problem by a standard SDP solver. However, time complexity ...
152
Voted
WADS
2009
Springer
15 years 10 months ago
2009
Springer
We consider the pair (pi, fi) as a force with two-dimensional direction vector fi applied at the point pi in the plane. For a given set of forces we ask for a non-crossing geometri...
163
Voted
AAAI
2010
15 years 5 months ago
2010
Dimensionality reduction is the process by which a set of data points in a higher dimensional space are mapped to a lower dimension while maintaining certain properties of these p...
115
Voted
AAAI
1998
15 years 5 months ago
1998
The "minimum margin" of an ensemble classifier on a given training set is, roughly speaking, the smallest vote it gives to any correct training label. Recent work has sh...