61 search results - page 8 / 13 » Degree spectra and computable dimensions in algebraic struct... |
DCG
1998
14 years 9 months ago
1998
The assumption of real-number arithmetic, which is at the basis of conventional geometric algorithms, has been seriously challenged in recent years, since digital computers do not...
GRC
2010
IEEE
14 years 10 months ago
2010
IEEE
Inference of latent variables from complicated data is one important problem in data mining. The high dimensionality and high complexity of real world data often make accurate infe...
CVPR
2010
IEEE
15 years 5 months ago
2010
IEEE
When classifying high-dimensional sequence data, traditional methods (e.g., HMMs, CRFs) may require large amounts of training data to avoid overfitting. In such cases dimensional...
CASC
2007
Springer
15 years 3 months ago
2007
Springer
We introduce the concept of comprehensive triangular decomposition (CTD) for a parametric polynomial system F with coefficients in a field. In broad words, this is a finite part...
DCC
2001
IEEE
15 years 9 months ago
2001
IEEE
The automorphism group of the Barnes-Wall lattice Lm in dimension 2m (m = 3) is a subgroup of index 2 in a certain "Clifford group" Cm of structure 21+2m + .O+ (2m, 2). ...