We consider the gradient method xt+1 = xt + t(st + wt), where st is a descent direction of a function f : n and wt is a deterministic or stochastic error. We assume that f is Lip...
In this paper we approach the problem of computing the characteristic polynomial of a matrix from the combinatorial viewpoint. We present several combinatorial characterizations of...
The normalized number of key comparisons needed to sort a list of randomly permuted items by the Quicksort algorithm is known to converge in distribution. We identify the rate of ...
: Information Visualization can make hypermedia systems more usable by presenting a site map to assist in navigation. In this paper we explain some of the difficulties in developin...
There is currently much interest in the organization and content-based querying image databases. The usual hypothesis is that image similarity can be characterized evel features, ...