4539 search results - page 552 / 908 » Approaches to Compute Workflow Complexity |
166
Voted
IBPRIA
2005
Springer
16 years 6 days ago
2005
Springer
We describe a fast algorithm for Gabor filtering, specially designed for multi-scale image representations. Our proposal is based on three facts: first, Gabor functions can be de...
166
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. We describe a cryptographically sound formal logic for proving protocol security properties without explicitly reasoning about probability, asymptotic complexity, or the ...
168
click to vote
ICALP
2005
Springer
16 years 6 days ago
2005
Springer
Abstract: The quantum adversary method is one of the most versatile lower-bound methods for quantum algorithms. We show that all known variants of this method are equivalent: spect...
164
click to vote
ILP
2005
Springer
16 years 5 days ago
2005
Springer
Abstract. Reasoning plays a central role in intelligent systems that operate in complex situations that involve time constraints. In this paper, we present the Adaptive Logic Inter...
156
click to vote
ISNN
2005
Springer
16 years 5 days ago
2005
Springer
This paper presents a block-adaptive subspace algorithm via oblique projection for blind source separation (BSS) problem of convolutive mixtures. In the proposed algorithm, the pro...