Sciweavers

3415 search results - page 292 / 683
» Lower bounds on kernelization
Sort
View
TIT
2010
103views Education» more  TIT 2010»
15 years 1 months ago
Codes in permutations and error correction for rank modulation
Codes for rank modulation have been recently proposed as a means of protecting flash memory devices from errors. We study basic coding theoretic problems for such codes, representi...
Alexander Barg, Arya Mazumdar
JMLR
2012
13 years 9 months ago
Minimax Rates of Estimation for Sparse PCA in High Dimensions
We study sparse principal components analysis in the high-dimensional setting, where p (the number of variables) can be much larger than n (the number of observations). We prove o...
Vincent Q. Vu, Jing Lei
ICML
2004
IEEE
16 years 7 months ago
Improving SVM accuracy by training on auxiliary data sources
The standard model of supervised learning assumes that training and test data are drawn from the same underlying distribution. This paper explores an application in which a second...
Pengcheng Wu, Thomas G. Dietterich
182
Voted
ASPLOS
2006
ACM
16 years 21 days ago
Tartan: evaluating spatial computation for whole program execution
Spatial Computing (SC) has been shown to be an energy-efficient model for implementing program kernels. In this paper we explore the feasibility of using SC for more than small k...
Mahim Mishra, Timothy J. Callahan, Tiberiu Chelcea...
EMNLP
2011
14 years 6 months ago
Relation Extraction with Relation Topics
This paper describes a novel approach to the semantic relation detection problem. Instead of relying only on the training instances for a new relation, we leverage the knowledge l...
Chang Wang, James Fan, Aditya Kalyanpur, David Gon...