815 search results - page 115 / 163 » Approximate Entropy Reducts |
IACR
2011
13 years 11 months ago
2011
Given a lattice L with the i-th successive minimum λi, its i-th gap λi λ1 often provides useful information for analyzing the security of cryptographic schemes related to L. The...
115
click to vote
ICML
2007
IEEE
16 years 19 days ago
2007
IEEE
Eigenvalue problems are rampant in machine learning and statistics and appear in the context of classification, dimensionality reduction, etc. In this paper, we consider a cardina...
CHI
2008
ACM
16 years 7 days ago
2008
ACM
The problem of extracting information from large collections of imagery is a challenge with few good solutions. Computers typically cannot interpret imagery as effectively as huma...
230
click to vote
VLDB
2002
ACM
16 years 1 days ago
2002
ACM
Our aim is to develop new database technologies for the approximate matching of unstructured string data using indexes. We explore the potential of the suffix tree data structure i...
ICCAD
2003
IEEE
15 years 8 months ago
2003
IEEE
In this paper, we present a reduced order inodeling methodology, based on the utilization of optimal non-uniform grids generated by Gaussian spectral rules, for the direct passive...