2745 search results - page 303 / 549 » A fast algorithm for computing large Fibonacci numbers |
138
click to vote
CCR
2002
15 years 4 months ago
2002
Accurate network traffic measurement is required for accounting, bandwidth provisioning and detecting DoS attacks. These applications see the traffic as a collection of flows they...
147
click to vote
ICALP
2004
Springer
15 years 10 months 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, ...
186
click to vote
ICS
2011
Tsinghua U.
14 years 8 months ago
2011
Tsinghua U.
The probability that a failure will occur before the end of the computation increases as the number of processors used in a high performance computing application increases. For l...
129
Voted
IPPS
2006
IEEE
15 years 11 months ago
2006
IEEE
We give an overview of the algorithms and implementations in the high-performance MPI libraries MPI/SX and MPI/ES of some of the most important collective operations of MPI (the M...
161
Voted
COMPGEOM
2000
ACM
15 years 9 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...