2767 search results - page 209 / 554 » Universal Exponentiation Algorithm |
177
click to vote
ICOIN
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. In this paper, we define the routing overhead as the amount of information needed to describe the changes in a network topology. We derive a universal lower bound on the...
103
click to vote
TAMC
2010
Springer
15 years 7 months ago
2010
Springer
Unless we resolve the P vs NP question, we are unable to say whether there is an algorithm (acceptor) that accepts Boolean tautologies in polynomial time and does not accept non-ta...
129
click to vote
CAV
1998
Springer
15 years 6 months ago
1998
Springer
bstract description of state machines (ASMs), in which data and data operations are d using abstract sort and uninterpreted function symbols. ASMs are suitable for describing Regis...
TSD
2000
Springer
15 years 6 months ago
2000
Springer
In text processing systems German words require special treatment because of the possibility to form compound words as a combination of existing words. To this end, a universal wor...
100
click to vote
IJCV
2000
15 years 2 months ago
2000
We present a universal statistical model for texture images in the context of an overcomplete complex wavelet transform. The model is parameterized by a set of statistics computed ...