is detected based on zero-crossings and closeness to user-specified end points. Subsequently, the 3-d location of the centre of the structure is computed from the centres of gravity of its two projections. This location is used to reverse the magnification factor caused by the cone-shaped projection of the x

intentions and agent intervention for helping students are specified. These two architectural design points are defined as connection points. The first connection point is named student intentions. Student intentions define situations in which agents might help. This connection point depends on the user

. To avoid the high computational and implementa-tion complexity of exact Hausdorff distance calculation, we approx-imate the Hausdorff distance within a user-specified error bound. The main ingredient of our approximation algorithm is a novel polygon subdivision scheme, called Voronoi subdivision, combined

Phonological distance measures 2 Phonological distance can be measured computationally using formally specified algorithms. This work investigates two such measures, one developed by Nerbonne and Heeringa (1997) based on Levenshtein distance (Levenshtein, 1965) and the other an adaptation

measures to specify, e.g., support, confidence and dependent quality. Unfortunately, given a data instance, users might not have any knowledge about the data distribution, thus it is very challenging to set the right parameters. In this paper, we study the determination of distance thresholds for metric

Abstract. Shortest paths and shortest path distances are important primary queries for users to query in a large graph. In this paper, we propose a new ap-proach to answer shortest path and shortest path distance queries efficiently with an error bound. The error bound is controlled by a user-specified

these approaches try to be comprehensive by considering the different proper-ties of object trajectories at different degrees, the distance functions are always pre-defined and therefore do not support different views on what users consider (dis)similar trajectories in a particular domain. In this paper, we

The Open Directory Project is clearly one of the largest collaborative efforts to manually annotate web pages. This effort involves over 65,000 editors and resulted in metadata specifying topic and importance for more than 4 million web pages. Still, given that this number is just about 0

We introduce an oblivious embedding that maps any string of length n to a string of length at most n/r for any user specified value of r. For any given r, our embedding provides a distortion of O(r for some = o(1) under edit distance, which we prove to be (almost) optimal. The embedding can

In this paper, we propose a filtering mechanism called FBDA(Filtering mechanism Based on Distance Approximation) for various kinds of information delivered in a broadcasting environment. FBDA is based on a metric space model in which a client filters out received data that is not within a specified