1964 search results - page 100 / 393 » Partitioning Based Algorithms for Some Colouring Problems |
CIKM
2007
Springer
13 years 12 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
With the explosive growth of Web and the recent development in digital media technology, the number of images on the Web has grown tremendously. Consequently, Web image clustering...
DOLAP
2004
ACM
14 years 1 months ago
2004
ACM
Nowadays, decision support systems are evolving in order to handle complex data. Some recent works have shown the interest of combining on-line analysis processing (OLAP) and data...
ISPA
2004
Springer
14 years 1 months ago
2004
Springer
Abstract. In mobile ad hoc networks (MANETs), networks can be partitioned into clusters. Clustering algorithms are localized algorithms that have the property of creating an upper ...
TALG
2010
13 years 6 months ago
2010
Given a rectangular boundary partitioned into rectangles, the Minimum-Length Corridor (MLC-R) problem consists of finding a corridor of least total length. A corridor is a set of ...