Abstract. Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log3 n) expected time, the edge of C whose removal result...
Hee-Kap Ahn, Mohammad Farshi, Christian Knauer, Mi...
Abstract. MOEA/D is a novel and successful Multi-Objective Evolutionary Algorithms(MOEA) which utilizes the idea of problem decomposition to tackle the complexity from multiple obj...
Wudong Liu, Qingfu Zhang, Edward P. K. Tsang, Cao ...
We describe some major recent progress in exact and symbolic linear algebra. These advances concern the improvement of complexity estimates for fundamental problems such as linear...
We demonstrate an active attack on the WEP protocol that is able to recover a 104-bit WEP key using less than 40,000 frames with a success probability of 50%. In order to succeed i...
We present an algorithm for generating panoramic images of complex scenes from a multi-sensor camera. We further present a programmable graphics hardware implementation to process...