Sciweavers

12825 search results - page 1843 / 2565
» Improved PLSOM algorithm
Sort
View
OODBS
2000
110views Database» more  OODBS 2000»
15 years 11 months ago
Opportunistic Prioritised Clustering Framework (OPCF)
Ever since the `early days' of database management systems, clustering has proven to be one of the most effective performance enhancement techniques for object oriented datab...
Zhen He, Alonso Marquez, Stephen Blackburn
AMAI
2008
Springer
15 years 7 months ago
The giving tree: constructing trees for efficient offline and online multi-robot coverage
This paper discusses the problem of building efficient coverage paths for a team of robots. An efficient multi-robot coverage algorithm should result in a coverage path for every ...
Noa Agmon, Noam Hazon, Gal A. Kaminka
SIGMETRICS
2008
ACM
150views Hardware» more  SIGMETRICS 2008»
15 years 7 months ago
Performance of random medium access control, an asymptotic approach
Random Medium-Access-Control (MAC) algorithms have played an increasingly important role in the development of wired and wireless Local Area Networks (LANs) and yet the performanc...
Charles Bordenave, David McDonald, Alexandre Prout...
GD
1998
Springer
15 years 11 months ago
Refinement of Orthogonal Graph Drawings
Current orthogonal graph drawing algorithms produce drawings which are generally good. However, many times the quality of orthogonal drawings can be significantly improved with a ...
Janet M. Six, Konstantinos G. Kakoulis, Ioannis G....
VLDB
1994
ACM
121views Database» more  VLDB 1994»
15 years 11 months ago
The Impact of Global Clustering on Spatial Database Systems
Global clustering has rarely been investigated in the area of spatial database systems although dramatic performance improvements can be achieved by using suitable techniques. In ...
Thomas Brinkhoff, Hans-Peter Kriegel
« Prev « First page 1843 / 2565 Last » Next »