2060 search results - page 181 / 412 » Some Applications of Coding Theory in Computational Complexi... |
GG
2004
Springer
15 years 3 months ago
2004
Springer
We show how edge-labelled graphs can be used to represent first-order logic formulae. This gives rise to recursively nested structures, in which each level of nesting corresponds ...
ALGORITHMICA
2005
14 years 10 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
107
click to vote
JCNS
2000
14 years 9 months ago
2000
We explore a computationally efficient method of simulating realistic networks of neurons introduced by Knight, Manin, and Sirovich (1996) in which integrate-and-fire neurons are ...
KER
2008
14 years 10 months ago
2008
This article surveys existing practical implementations of both defeasible and argumentationbased reasoning engines and associated literature. We aim to summarise the current stat...
DCC
1996
IEEE
15 years 2 months ago
1996
IEEE
The block processing inherent in the use of traditional vector quantization (VQ) schemes typically gives rise to perceptually distracting blocking artifacts. We demonstrate that s...