88 search results - page 11 / 18 » Regular Cost Functions over Finite Trees |
121
click to vote
SIAMCOMP
2002
14 years 11 months ago
2002
We characterize all limit laws of the quicksort type random variables defined recursively by Xn d = XIn + X n-1-In + Tn when the "toll function" Tn varies and satisfies ...
LPAR
2010
Springer
14 years 9 months ago
2010
Springer
A rational and selfish environment may have an incentive to cheat the system it interacts with. Cheating the system amounts to reporting a stream of inputs that is different from ...
EUROCRYPT
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. We present a technique for Merkle tree traversal which requires only logarithmic space and time1 . For a tree with N nodes, our algorithm computes sequential tree leaves ...
MONET
2002
14 years 11 months ago
2002
The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical c...
ICPR
2008
IEEE
15 years 6 months ago
2008
IEEE
In this paper, we propose a new approach to the non-rigid image registration. This problem can be easily attacked if we can find regularly distributed correspondence points over ...