Sciweavers

60 search results - page 4 / 12
» An exponential separation between regular and general resolu...
Sort
View
FOCS
2007
IEEE
14 years 1 months ago
Parameterized Proof Complexity
We propose a proof-theoretic approach for gaining evidence that certain parameterized problems are not fixedparameter tractable. We consider proofs that witness that a given prop...
Stefan S. Dantchev, Barnaby Martin, Stefan Szeider
CVPR
2007
IEEE
14 years 9 months ago
Soft Edge Smoothness Prior for Alpha Channel Super Resolution
Effective image prior is necessary for image super resolution, due to its severely under-determined nature. Although the edge smoothness prior can be effective, it is generally di...
Shengyang Dai, Mei Han, Wei Xu, Ying Wu, Yihong Go...
BMCBI
2007
108views more  BMCBI 2007»
13 years 7 months ago
Design and implementation of a generalized laboratory data model
Background: Investigators in the biological sciences continue to exploit laboratory automation methods and have dramatically increased the rates at which they can generate data. I...
Michael C. Wendl, Scott Smith, Craig S. Pohl, Davi...
STOC
2012
ACM
196views Algorithms» more  STOC 2012»
11 years 9 months ago
Time-space tradeoffs in resolution: superpolynomial lower bounds for superlinear space
We give the first time-space tradeoff lower bounds for Resolution proofs that apply to superlinear space. In particular, we show that there are formulas of size N that have Reso...
Paul Beame, Christopher Beck, Russell Impagliazzo
JMLR
2010
123views more  JMLR 2010»
13 years 5 months ago
Maximum Relative Margin and Data-Dependent Regularization
Leading classification methods such as support vector machines (SVMs) and their counterparts achieve strong generalization performance by maximizing the margin of separation betw...
Pannagadatta K. Shivaswamy, Tony Jebara