Sciweavers

6045 search results - page 305 / 1209
» Computable Linearizations of Well-partial-orderings
Sort
View
DCC
1998
IEEE
15 years 7 months ago
Quasideterminant Characterization of MDS Group Codes over Abelian Groups
A group code defined over a group G is a subset of Gn which forms a group under componentwise group operation. The well known matrix characterization of MDS (Maximum Distance Sepa...
A. A. Zain, B. Sundar Rajan
TCS
1998
15 years 7 months ago
Proving Possibility Properties
A method is described for proving “always possibly” properties of specifications in formalisms with linear-time trace semantics. It is shown to be relatively complete for TLA...
Leslie Lamport
ACL
2010
15 years 5 months ago
Domain Adaptation of Maximum Entropy Language Models
We investigate a recently proposed Bayesian adaptation method for building style-adapted maximum entropy language models for speech recognition, given a large corpus of written la...
Tanel Alumäe, Mikko Kurimo
CVPR
2011
IEEE
15 years 3 months ago
Robust Sparse Coding for Face Recognition
Recently the sparse representation (or coding) based classification (SRC) has been successfully used in face recognition. In SRC, the testing image is represented as a sparse lin...
Meng Yang, Lei Zhang
CAP
2010
15 years 2 months ago
Parallel operations of sparse polynomials on multicores: I. multiplication and Poisson bracket
The multiplication of the sparse multivariate polynomials using the recursive representations is revisited to take advantage on the multicore processors. We take care of the memor...
Mickaël Gastineau