2127 search results - page 8 / 426 » Computing large matchings fast |
ACSC
2005
IEEE
14 years 1 months ago
2005
IEEE
A k-separated matching in a graph is a set of edges at distance at least k from one another (hence, for instance, a 1-separated matching is just a matching in the classical sense)...
IPL
2000
13 years 7 months ago
2000
We present a fast algorithm for computing large Fibonacci numbers. It is known that the product of Lucas numbers algorithm uses the fewest bit operations to compute the Fibonacci ...
EDBT
2006
ACM
14 years 7 months ago
2006
ACM
The need of processing graph reachability queries stems from many applications that manage complex data as graphs. The applications include transportation network, Internet traffic...
CPHYSICS
2008
13 years 7 months ago
2008
This paper presents a fast algorithm to compute the global clear-sky irradiation, appropriate for extended high-resolution Digital Elevation Models (DEMs). The latest equations pu...
ASIACRYPT
2005
Springer
14 years 28 days ago
2005
Springer
Let X1, X2, . . . , Xk be independent n bit random variables. If they have arbitrary distributions, we show how to compute distributions like Pr{X1 ⊕ X2 ⊕ · · · ⊕ Xk} and ...