2767 search results - page 329 / 554 » Universal Exponentiation Algorithm |
177
click to vote
APPROX
2004
Springer
16 years 13 days ago
2004
Springer
While it is exponentially unlikely that a sparse random graph or hypergraph is connected, with probability 1 − o(1) such a graph has a “giant component” that, given its numbe...
180
Voted
ICALP
2004
Springer
16 years 12 days ago
2004
Springer
We present a domain-theoretic version of Picard’s theorem for solving classical initial value problems in Rn . For the case of vector fields that satisfy a Lipschitz condition, ...
199
click to vote
SGAI
2004
Springer
16 years 11 days ago
2004
Springer
As the web expands exponentially, the need to put some order to its content becomes apparent. Hypertext categorization, that is the automatic classification of web documents into ...
187
Voted
CHES
2003
Springer
16 years 8 days ago
2003
Springer
Abstract. Efficient implementations of RSA on computationally limited devices, such as smartcards, often use the CRT technique in combination with Garner’s algorithm in order to ...
217
Voted
WEBDB
2010
Springer
16 years 2 days ago
2010
Springer
The transition of search engine users’ intents has been studied for a long time. The knowledge of intent transition, once discovered, can yield a better understanding of how di...