2621 search results - page 27 / 525 » Near orders and codes |
VLDB
2007
ACM
14 years 8 months ago
2007
ACM
In previous papers [SC05, SBC+07], some of us predicted the end of "one size fits all" as a commercial relational DBMS paradigm. These papers presented reasons and exper...
JUCS
2010
13 years 7 months ago
2010
: We investigate the problem of decomposing a language into a catenation of nontrivial languages, none of which can be decomposed further. In many cases this leads to the operation...
DCC
2002
IEEE
14 years 8 months ago
2002
IEEE
In this paper, we report work on a family of variable-length codes with less redundancy than the de facto flat code used in most of the variable size dynamic dictionary based comp...
AAECC
2006
Springer
13 years 8 months ago
2006
Springer
Cyclicity of a convolutional code (CC) is relying on a nontrivial automorphism of the algebra F[x]/(xn - 1), where F is a finite field. A particular choice of the data leads to th...
VTC
2008
IEEE
14 years 2 months ago
2008
IEEE
—When the maximum number of best candidates retained at each tree search level of the K-Best Sphere Detection (SD) is kept low for the sake of maintaining a low memory requiremen...