The BSS, which has been used in all City's TREC experiments, is a set-oriented ranked output system designed primarily for probabilistic{type retrieval of textual material using inverted indexes. There is a family of built-in weighting functions as described in [1, Section 3]. In addition to weighting and ranking facilities it has the usual boolean and quasi-boolean (positional) operations. The...

We study upward planar straight-line embeddings (UPSE) of directed trees on given point sets. The set S has size at least the number vertices in tree. For special case where tree is a path P we show that: (a) If one-sided convex, UPSE s equals maximal monotone paths P. (b) general position and composed by three paths, middle longer than other two, then it always admits an S. that decision probl...

When reverse engineering a CAD model, it is necessary to integrate information from several views of an object into a common reference frame. Given a rough initial alignment of local 3-D shape data in several images, further re nement is achieved using an improved version of the recently popular Iterative Closest Point algorithm. Improved data correspondence is determined by considering the mer...