8009 search results - page 1527 / 1602 » cans 2005 |
168
click to vote
CIVR
2005
Springer
15 years 12 months ago
2005
Springer
In the paper, we proposed a novel feature descriptor using over-complete wavelet transform and wavelet domain based fractal signature for texture image analysis and retrieval. Trad...
163
click to vote
CLEF
2005
Springer
15 years 12 months ago
2005
Springer
Abstract. This paper describes an investigation of data fusion techniques for spoken document retrieval. The effectiveness of retrievals solely based on the outputs from automatic...
180
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
205
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
Consider a two-party quantum communication protocol for computing some function f : {0, 1}n × {0, 1}n → Z. We show that the first message of P can be compressed to O(k) classi...
173
click to vote
COCO
2005
Springer
15 years 12 months ago
2005
Springer
We introduce two new complexity measures for Boolean functions, which we name sumPI and maxPI. The quantity sumPI has been emerging through a line of research on quantum query com...