103 search results - page 16 / 21 » Representations of graphs modulo n |
125
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
The new method for Reed-Solomon codes decoding is introduced. The method is based on the star trellis decoding of the binary image of Reed-Solomon codes. I. THE GOLAY CODE IN STAR...
133
click to vote
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
— To approximate complex data, we propose new type of low-dimensional “principal object”: principal cubic complex. This complex is a generalization of linear and nonlinear pr...
133
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...
146
click to vote
CORR
2010
Springer
15 years 1 months ago
2010
Springer
In a previous work we introduced slice graphs as a way to specify both infinite languages of directed acyclic graphs (DAGs) and infinite languages of partial orders. Therein we fo...
142
click to vote
FOCS
2003
IEEE
15 years 9 months ago
2003
IEEE
We introduce a unifying framework for proving that predicate P is hard-core for a one-way function f, and apply it to a broad family of functions and predicates, reproving old res...