29908 search results - page 146 / 5982 » On the Complexity of |
144
click to vote
ISCAS
2002
IEEE
15 years 11 months ago
2002
IEEE
This paper explores subband processing of complex (I/Q) signals which finds various important applications especially in communications signal processing. Instead of using tradit...
164
click to vote
EUROGP
2001
Springer
15 years 11 months ago
2001
Springer
Recent theory work has shown that a Genetic Program (GP) used to produce programs may have output that is bounded above by the GP itself [l]. This paper presents proofs that show t...
161
click to vote
STACS
2001
Springer
15 years 11 months ago
2001
Springer
Most known constructions of probabilistically checkable proofs (PCPs) either blow up the proof size by a large polynomial, or have a high (though constant) query complexity. In thi...
180
click to vote
ADBIS
2000
Springer
15 years 10 months ago
2000
Springer
Data collected in many applications have a form of sequences of events. One of the popular data mining problems is discovery of frequently occurring episodes in such sequences. Eff...
178
click to vote
QCQC
1998
Springer
15 years 10 months ago
1998
Springer
Abstract. We consider the communication complexity of the binary inner product function in a variation of the two-party scenario where the parties have an a priori supply of partic...