6568 search results - page 352 / 1314 » Reducing the Complexity of Reductions |
239
click to vote
AAAI
2011
14 years 7 months ago
2011
In this paper, we propose a variant of the conservativeupdate Count-Min sketch to further reduce the overestimation error incurred. Inspired by ideas from lossy counting, we divid...
269
click to vote
PAMI
2012
13 years 10 months ago
2012
— This paper addresses the problem of large-scale image search. Three constraints have to be taken into account: search accuracy, efficiency, and memory usage. We first present...
179
Voted
ICC
2007
IEEE
16 years 1 months ago
2007
IEEE
― In this paper, a modified bit-flipping decoding algorithm for low-density parity-check (LDPC) codes is proposed. Both improvement in performance and reduction in decoding delay...
183
click to vote
IPL
2007
15 years 7 months ago
2007
We present a new proof of PSPACE-hardness of the emptiness problem for alternating finite automata with a singleton alphabet. This result was shown by Holzer (1995) who used a pr...
188
Voted
ACTA
2004
15 years 7 months ago
2004
The generative capability of several variants of P systems with symport/antiport is studied via the simulation of counter automata. This leads to the reduction of the complexity, e...