We state a new sampling lemma and use it to improve the running time of dynamic graph algorithms. For the dynamic connectivity problem the previously best randomized algorithm takes expected time O(log 3 n) per update, amortized over (m) updates. Using the new sampling lemma, we improve its running time to O(log 2 n). There exists a lower bound in the cell probe model for the time per operation...

We generalize Cuckoo Hashing 23] to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 +) n memory cells, for any constant > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d = O(ln 1) probes and the expected amortized insertion time is constant. This is the rst dictionary that has worst case constant acce...

We propose a quasi-Newton line-search method that uses negative curvature directions for solving unconstrained optimization problems. In this method, the symmetric rank-one (SR1) rule is used to update the Hessian approximation. The SR1 update rule is known to have a good numerical performance; however, it does not guarantee positive definiteness of the updated matrix. We first discuss the deta...

The classical problem setup of iterative learning control (ILC) is to enforce tracking a reference profile specified at all time points in the fixed task duration. removal specification releases significant design freedom how path followed but has not been fully exploited literature. This article unlocks this extra by formulating ILC description handle repeated path-following tasks, e.g., weldi...

Development and maintenance of Web application is still a complex and error-prone process. We need integrated techniques and tool support for automated generation of Web systems and a ready prescription for easy maintenance. The MDA approach proposes an architecture taking into account the development and maintenance of large and complex software. In this paper, we apply MDA approach for genera...

Updating an abstract Voronoi diagram in linear time, after deletion of one site, has been an open problem for a long time. Similarly for various concrete Voronoi diagrams of generalized sites, other than points. In this paper we present a simple, expected linear-time algorithm to update an abstract Voronoi diagram after deletion. We introduce the concept of a Voronoi-like diagram, a relaxed ver...