3735 search results - page 320 / 747 » Order compression schemes |
228
click to vote
CL
2000
Springer
15 years 7 months ago
2000
Springer
Associative Language Descriptions are a recent grammar model, theoretically less powerful than Context Free grammars, but adequate for describing the syntax of programming languag...
156
click to vote
TIS
2002
15 years 7 months ago
2002
stract entity pointing forward, but by a "web" allowing for different strands to go their own way while weaved together to create a coherent pattern, and this is how the ...
195
Voted
ICDM
2010
IEEE
15 years 5 months ago
2010
IEEE
Abstract--We propose a new Consistent Weighted Sampling method, where the probability of drawing identical samples for a pair of inputs is equal to their Jaccard similarity. Our me...
226
Voted
ISAMI
2010
15 years 5 months ago
2010
Probabilistic models of languages are fundamental to understand and learn the profile of the subjacent code in order to estimate its entropy, enabling the verification and predicti...
248
Voted
TIT
2010
15 years 2 months ago
2010
Orthogonal matching pursuit (OMP) is the canonical greedy algorithm for sparse approximation. In this paper we demonstrate that the restricted isometry property (RIP) can be used f...