2621 search results - page 195 / 525 » Near orders and codes |
155
click to vote
APPROX
2005
Springer
16 years 3 days ago
2005
Springer
A q-ary error-correcting code C ⊆ {1, 2, . . . , q}n is said to be list decodable to radius ρ with list size L if every Hamming ball of radius ρ contains at most L codewords o...
189
click to vote
ICCS
2005
Springer
16 years 2 days ago
2005
Springer
Cray X1 Fortran and C/C++ compilers provide a number of loop transformations, notably vectorization and multistreaming, in order to exploit the multistreaming processor (MSP) hard...
179
click to vote
EUROPAR
2003
Springer
15 years 11 months ago
2003
Springer
Abstract. This paper shows how a sparse hypermatrix Cholesky factorization can be improved. This is accomplished by means of efficient codes which operate on very small dense matri...
166
click to vote
CSMR
1998
IEEE
15 years 10 months ago
1998
IEEE
Secure distributed applications often include code to authenticate users, verify access rights, and establish secure communication channels between software components (e.g., clie...
180
click to vote
FASE
2009
Springer
15 years 10 months ago
2009
Springer
Model checking tools based on the iterative refinement of predicate abstraction (e.g., Slam and Blast) often feature a specification language for expressing complex behavior rules....