Given a polygonal path P with vertices p1, p2, . . . , pn and a real number t ≥ 1, a path Q = (pi1 , pi2 , . . . , pik ) is a t-distance-preserving approximation of P if 1 = i1 &...
Joachim Gudmundsson, Giri Narasimhan, Michiel H. M...
A key idea in cryptography is using hard functions in order to obtain secure schemes. The theory of hard functions (e.g. one-way functions) has been a great success story, and the ...
Abstract. This paper presents several engineering applications that involve distributed software services. Due to the complexity of these applications, an efficient and flexible se...
An existing distributed lift system was analyzed using the process algebraic language µCRL [7]. Four problems were found, three of which were also found independently by the devel...
—This paper presents the design of BAUT, a tutoring system that explores statistical approach for providing instant project failure analysis. Driven by a Bayesian Network (BN) in...