1449 search results - page 109 / 290 » Self-Randomized Exponentiation Algorithms |
169
click to vote
GD
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many graph drawing algorithms use st-numberings (st-orientations or bipolar orientations) as a first step. An st-numbering of a biconnected undirected graph defines a d...
166
click to vote
ICML
2005
IEEE
16 years 7 months ago
2005
IEEE
We introduce an expectation maximizationtype (EM) algorithm for maximum likelihood optimization of conditional densities. It is applicable to hidden variable models where the dist...
163
click to vote
DATE
2007
IEEE
16 years 19 days ago
2007
IEEE
In this paper we introduce a new algorithm for model order reduction in the presence of parameter or process variation. Our analysis is performed using a graph interpretation of t...
159
click to vote
CSCLP
2005
Springer
15 years 12 months ago
2005
Springer
CSP search algorithms are exponential in the worst-case. A trivial upper bound on the time complexity of CSP search algorithms is O∗ (dn ), where n and d are the number of variab...
159
click to vote
ARITH
2003
IEEE
15 years 11 months ago
2003
IEEE
A high-radix composite algorithm for the computation of the powering function (¤¦¥ ) is presented in this paper. The algorithm consists of a sequence of overlapped operations: ...