360 search results - page 39 / 72 » Spatial Clustering Algorithm Based on Hierarchical-Partition... |
130
click to vote
APWEB
2005
Springer
15 years 8 months ago
2005
Springer
This paper presents a new method for visualizing and navigating huge graphs. The main feature of this method is that it applies Level-Of-Detail (LOD) strategy to graph visualizati...
146
click to vote
ECIR
2006
Springer
15 years 3 months ago
2006
Springer
Abstract. In this paper we show how approximate matrix factorisations can be used to organise document summaries returned by a search engine into meaningful thematic categories. We...
149
click to vote
SIGMOD
2005
ACM
15 years 8 months ago
2005
ACM
In this paper, we propose new graph-based data structure and indexing to organize and retrieve video data. Several researches have shown that a graph can be a better candidate for...
127
click to vote
IPL
1998
15 years 2 months ago
1998
The k-MST problem requires finding that subset of at least k vertices of a given graph whose Minimum Spanning Tree has least weight amongst all subsets of at least k vertices. Th...
132
click to vote
COSIT
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. The navigation task is a very demanding application for mobile users. The algorithms of present software solutions are based on the established methods of car navigation ...