Sciweavers

1930 search results - page 69 / 386
» Epistemic comparative conditionals
Sort
View
CORR
2010
Springer
133views Education» more  CORR 2010»
14 years 12 months ago
Nonuniform Sparse Recovery with Gaussian Matrices
Compressive sensing predicts that sufficiently sparse vectors can be recovered from highly incomplete information. Efficient recovery methods such as 1-minimization find the sparse...
Ulas Ayaz, Holger Rauhut
ENTCS
2008
91views more  ENTCS 2008»
14 years 12 months ago
Towards Concrete Syntax Patterns for Logic-based Transformation Rules
Logic meta-programming in Prolog is a powerful way to express program analysis and transformation. However, its use can be difficult and error-prone because it requires programmer...
Malte Appeltauer, Günter Kniesel
CSDA
2006
117views more  CSDA 2006»
14 years 12 months ago
GACV for quantile smoothing splines
Quantile smoothing splines provide nonparametric estimation of conditional quantile functions. Like other nonparametric smoothing techniques, the choice of smoothing parameters co...
Ming Yuan
IJCSA
2008
132views more  IJCSA 2008»
14 years 12 months ago
Biomedical Named Entity Recognition Based on Classifiers Ensemble
In this paper, we present classifiers ensemble approaches for biomedical named entity recognition. Generalized Winnow, Conditional Random Fields, Support Vector Machine, and Maxim...
Haochang Wang, Tiejun Zhao, Hongye Tan, Shu Zhang
CORR
2007
Springer
80views Education» more  CORR 2007»
14 years 12 months ago
Polygraphs for termination of left-linear term rewriting systems
– We present a methodology for proving termination of left-linear term rewriting systems (TRSs) by using Albert Burroni’s polygraphs, a kind of rewriting systems on algebraic c...
Yves Guiraud