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...
Abstract. This paper presents several engineering applications that involve distributed software services. Due to the complexity of these applications, an efficient and flexible se...
This paper addresses a simple, yet fundamental question in the design of peer-to-peer systems: What does it mean when we say “availability” and how does this understanding imp...
Ranjita Bhagwan, Stefan Savage, Geoffrey M. Voelke...
Abstract. Term weighting is one of the most important aspects of modern Web retrieval systems. The weight associated with a given term in a document shows the importance of the ter...
Abstract. We present a prototype sketch-based physics tutoring system that combines mathematical sketching, an interaction paradigm that supports construction of dynamic illustrati...