521 search results - page 26 / 105 » Sparse probabilistic classifiers |
IDA
2002
Springer
14 years 10 months ago
2002
Springer
Recently we presented a new approach [20] to the classification problem arising in data mining. It is based on the regularization network approach but in contrast to other methods...
ASIACRYPT
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. We describe two improvements to Gentry's fully homomorphic scheme based on ideal lattices and its analysis: we provide a more aggressive analysis of one of the hardn...
CORR
2010
Springer
14 years 10 months ago
2010
Springer
As shown by Tropp, 2008, for the concatenation of two orthonormal bases (ONBs), breaking the square-root bottleneck in compressed sensing does not require randomization over all th...
NLPRS
2001
Springer
15 years 2 months ago
2001
Springer
This paper proposes a method to resolve Japanese zero pronouns by identifying their antecedents. Our method uses a probabilistic model, which is decomposed into syntactic and sema...
ISMB
1998
14 years 11 months ago
1998
Computingthree-dimensional structures from sparse experimentalconstraints requires methodsfor combining heterogeneoussourcesof information,such as distances, angles, andmeasuresof...