We examine the problem of searching a database of three dimensional objects given in VRML for objects similar to a given ob ject We introduce an algorithm which is both iterative and interactive Rather than base the search solely on geometric feature similarity we propose letting the user in uence future search results by marking some of the results of the current search as relevant or irreleva...

We consider several cases of the point matching problem in which we are to nd a transformation of a set of n points such that each transformed point lies in one of n given pairwise-disjoint \noise regions". We prove upper and lower bounds on the number of possible matches, under a variety of types of transformations (rotations, translations, similarity, etc.) and noise regions (circles, squares...

Linear Programming 15 after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n+dd+1) log n). By combining this algorithm with a randomized recursive algorithm, Clarkson improved the expected runn...

Linear Programming 15 contain such a constraint), which implies that after kd iterations (H) (B) 2k. Hence, after kd successful rounds, 2k (H) nek=3. This implies that the above algorithm terminates in at most 3d lnn successful rounds. Since each round takes O(dd) time to compute xR and O(dn) time to compute V , the expected running time of the algorithm is O((d2n+dd+1) log n). By combining thi...

In order to numerically invert Laplace transforms to calculate probability distributions in queueing and related models, we need to be able to calculate the Laplace transform values. In many cases the desired Laplace transform values (e.g., of a waiting-time distribution) can be computed when the Laplace transform values of component probability density functions (pdf's) (e.g., of a service-tim...

A method for restoring an optical image which is subjected to low-pass frequency filtering is presented. It is assumed that the object whose image is restored is of finite spatial extent. The problem is treated as an algebraic image-restoration problem which is then solved as a quadratic programming problem with bounded variables. The regularization technique for the ill-posed system is to repl...