2095 search results - page 116 / 419 » Improved pebbling bounds |
102
click to vote
WIOPT
2005
IEEE
15 years 6 months ago
2005
IEEE
We propose a model under which several inherent properties of the Exponential Age SEarch routing protocol can be derived. By making simpliļ¬cations on this model, we are able to ...
CIAC
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. Given two rooted, labeled trees P and T the tree path subsequence problem is to determine which paths in P are subsequences of which paths in T. Here a path begins at the...
FMCAD
2000
Springer
15 years 4 months ago
2000
Springer
We present a symbolic algorithm for strongly connected component decomposition. The algorithm performs (n log n) image and preimage computations in the worst case, where n is the n...
USS
2008
15 years 3 months ago
2008
Implementation-level vulnerabilities are a persistent threat to the security of computing systems. We propose using the results of partially-successful verification attempts to pl...
110
click to vote
DCG
2006
15 years 1 months ago
2006
We show, with an elementary proof, that the number of halving simplices in a set of n points in R4 in general position is O(n4-2/45). This improves the previous bound of O(n4-1/13...