Sciweavers

4903 search results - page 324 / 981
» The Set Covering Machine
Sort
View
ICML
2010
IEEE
15 years 7 months ago
On Sparse Nonparametric Conditional Covariance Selection
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...
Mladen Kolar, Ankur P. Parikh, Eric P. Xing
APAL
2006
64views more  APAL 2006»
15 years 6 months ago
What can be efficiently reduced to the Kolmogorov-random strings?
We investigate the question of whether one can characterize complexity classes (such as PSPACE or NEXP) in terms of efficient reducibility to the set of Kolmogorovrandom strings R...
Eric Allender, Harry Buhrman, Michal Koucký
NPL
2002
103views more  NPL 2002»
15 years 6 months ago
Kernel Nearest Neighbor Algorithm
The `kernel approach' has attracted great attention with the development of support vector machine (SVM) and has been studied in a general way. It offers an alternative soluti...
Kai Yu, Liang Ji, Xuegong Zhang
ACL
2010
15 years 4 months ago
TrustRank: Inducing Trust in Automatic Translations via Ranking
The adoption of Machine Translation technology for commercial applications is hampered by the lack of trust associated with machine-translated output. In this paper, we describe T...
Radu Soricut, Abdessamad Echihabi
COLT
2010
Springer
15 years 4 months ago
Principal Component Analysis with Contaminated Data: The High Dimensional Case
We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of obse...
Huan Xu, Constantine Caramanis, Shie Mannor