327 search results - page 45 / 66 » A fully dynamic algorithm for planar |
DAM
2007
13 years 7 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
CIKM
2006
Springer
13 years 9 months ago
2006
Springer
In this paper, we propose a fast, memory-efficient, and scalable clustering algorithm for analyzing transactional data. Our approach has three unique features. First, we use the c...
FCCM
2002
IEEE
14 years 20 days ago
2002
IEEE
To fully realize the benefits of partial and rapid reconfiguration of field-programmable devices, we often need to dynamically schedule computing tasks and generate instance-sp...
GLOBECOM
2008
IEEE
14 years 2 months ago
2008
IEEE
—In order to fully utilize spectrum, auction-based dynamic spectrum allocation has become a promising approach which allows unlicensed wireless users to lease unused bands from s...
ICSM
2000
IEEE
14 years 3 days ago
2000
IEEE
Conditioned slicing is a powerful generalisation of static and dynamic slicing which has applications to many problems in software maintenance and evolution, including re-use, ree...