753 search results - page 42 / 151 » Completing a (k - 1)-Assignment |
DCG
2008
14 years 10 months ago
2008
We construct CW spheres from the lattices that arise as the closed sets of a convex closure, the meet-distributive lattices. These spheres are nearly polytopal, in the sense that t...
CSDA
2007
14 years 9 months ago
2007
Random k-nearest-neighbour (RKNN) imputation is an established algorithm for filling in missing values in data sets. Assume that data are missing in a random way, so that missing...
DM
2007
14 years 9 months ago
2007
A quasigroup (Q, ∗) is called totally anti-symmetric if (c ∗ x) ∗ y = (c ∗ y) ∗ x ⇒ x = y and x∗y = y∗x ⇒ x = y. A totally anti-symmetric quasigroup can be used ...
CORR
2011
Springer
14 years 4 months ago
2011
Springer
The multi-layer bit-wise unequal error protection problem is considered for variable length block codes with feedback. Inner and outer bounds are derived for achievable performanc...
MST
2010
14 years 4 months ago
2010
The 1-versus-2 queries problem, which has been extensively studied in computational complexity theory, asks in its generality whether every efficient algorithm that makes at most 2...