-
1
-
-
0042777467
-
Kernel independent components analysis
-
Department of computer science, University of California, Berkeley, Berkeley, CA
-
F. Bach and M.I. Jordan. Kernel independent components analysis. Department of computer science, University of California, Berkeley, Berkeley, CA, 2001.
-
(2001)
-
-
Bach, F.1
Jordan, M.I.2
-
3
-
-
0026860799
-
Robust linear programming discrimination of two linearly inseparable sets
-
K. P. Bennett and O. L. Mangasarian. Robust linear programming discrimination of two linearly inseparable sets. Optimization Methods and Software, 1:23-34, 1992.
-
(1992)
Optimization Methods and Software
, vol.1
, pp. 23-34
-
-
Bennett, K.P.1
Mangasarian, O.L.2
-
4
-
-
0043091624
-
Sparse matrix re-ordering schemes for browsing hypertext
-
In J. Renegar, M. Shub, and S.Smale, editors, American Mathematical Society
-
M.W. Berry, B. Hendrickson, and P. Raghaven. Sparse matrix re-ordering schemes for browsing hypertext. In J. Renegar, M. Shub, and S.Smale, editors, The Mathematics of Numerical Analysis, pages 91-123. American Mathematical Society, 1996.
-
(1996)
The Mathematics of Numerical Analysis
, pp. 91-123
-
-
Berry, M.W.1
Hendrickson, B.2
Raghaven, P.3
-
6
-
-
0004148979
-
Entropy, compactness and the approximation of operators
-
Cambridge University Press, Cambridge, UK
-
B. Carl and I. Stephani. Entropy, compactness and the approximation of operators. Cambridge University Press, Cambridge, UK, 1990.
-
(1990)
-
-
Carl, B.1
Stephani, I.2
-
11
-
-
0032800925
-
Clustering in large graphs and matrices
-
P. Drineas, R. Kannan, S. Vampala, A. Frieze, and V. Vinay. Clustering in large graphs and matrices. In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms, 1999.
-
(1999)
Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms
-
-
Drineas, P.1
Kannan, R.2
Vampala, S.3
Frieze, A.4
Vinay, V.5
-
12
-
-
33845255307
-
Estimating the optimal margins of embeddings in euclidean half spaces
-
In Submitted
-
J. Forster, N. Schmitt, and H. U. Simon. Estimating the optimal margins of embeddings in euclidean half spaces. In Submitted Computational Learning Theory (COLT) 2001, 2001.
-
(2001)
Computational Learning Theory (COLT)
, pp. 2001
-
-
Forster, J.1
Schmitt, N.2
Simon, H.U.3
-
14
-
-
1942515510
-
Learning the kernel matrix using semi-definite programming
-
N. Lanckriet, N. Cristianini, P. Bartlett, L. El-Ghoui, and M.I Jordan. Learning the kernel matrix using semi-definite programming. In International Conference on Machine Learning (ICML 2002), 2002.
-
(2002)
International Conference on Machine Learning (ICML 2002)
-
-
Lanckriet, N.1
Cristianini, N.2
Bartlett, P.3
El-Ghoui, L.4
Jordan, M.I.5
-
15
-
-
0001035413
-
On the method of bounded differences
-
C. McDiarmid. On the method of bounded differences. In Surveys in Combinatorics, pages 148-188, 1989.
-
(1989)
Surveys in Combinatorics
, pp. 148-188
-
-
McDiarmid, C.1
-
17
-
-
0000812783
-
Partitioning sparse matrices with eigenvectors of graphs
-
A. Pothen, H. Simon, and K. Liou. Partitioning sparse matrices with eigenvectors of graphs. SIAM Journal Matrix Analysis, 11(3):242-248, 1990.
-
(1990)
SIAM Journal Matrix Analysis
, vol.11
, Issue.3
, pp. 242-248
-
-
Pothen, A.1
Simon, H.2
Liou, K.3
-
21
-
-
0032166068
-
Structural risk minimization over data-dependent hierarchies
-
J. Shawe-Taylor, P. L. Bartlett, R. C. Williamson, and M. Anthony. Structural risk minimization over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5):1926-1940, 1998.
-
(1998)
IEEE Transactions on Information Theory
, vol.44
, Issue.5
, pp. 1926-1940
-
-
Shawe-Taylor, J.1
Bartlett, P.L.2
Williamson, R.C.3
Anthony, M.4
|