Standardized 32-bit Cyclic Redundancy Codes provide fewer bits of guaranteed error detection than they could, achieving a Hamming Distance (HD) of only 4 for maximum-length Ethern...
We de ne the sharply bounded hierarchy, SBH(QL), a hierarchy of classes within P, using quasilinear-time computation and quanti cation over strings of length logn. It generalizes ...
Stephen A. Bloch, Jonathan F. Buss, Judy Goldsmith
Starting with a similarity function between objects, it is possible to define a distance metric (the kernel distance) on pairs of objects, and more generally on probability distr...
Sarang C. Joshi, Raj Varma Kommaraju, Jeff M. Phil...
We give a universal kernel that renders all the regular languages linearly separable. We are not able to compute this kernel efficiently and conjecture that it is intractable, but...
Learning problems form an important category of computational tasks that generalizes many of the computations researchers apply to large real-life data sets. We ask: what concept ...
Shiva Prasad Kasiviswanathan, Homin K. Lee, Kobbi ...