1245 search results - page 59 / 249 » Binary Sparse Coding |
123
click to vote
CODES
2005
IEEE
15 years 4 months ago
2005
IEEE
We describe results of a case study whose intent was to determine whether new techniques for hardware/software partitioning of an application’s binary are competitive with parti...
ECCC
2010
15 years 2 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...
110
click to vote
STOC
2003
ACM
16 years 2 months ago
2003
ACM
We construct binary codes for fingerprinting. Our codes for n users that are -secure against c pirates have length O(c2 log(n/ )). This improves the codes proposed by Boneh and Sh...
136
click to vote
JSC
2011
14 years 5 months ago
2011
In 1974, Johnson showed how to multiply and divide sparse polynomials using a binary heap. This paper introduces a new algorithm that uses a heap to divide with the same complexit...
100
click to vote
INTERSPEECH
2010
14 years 9 months ago
2010
Musical noise often arises in the outputs of time-frequency binary mask based blind source separation approaches. Postprocessing is desired to enhance the separation quality. An e...