Sciweavers

4009 search results - page 323 / 802
» Clustering on Complex Graphs
Sort
View
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 6 months ago
Finding time-dependent shortest paths over large graphs
The spatial and temporal databases have been studied widely and intensively over years. In this paper, we study how to answer queries of finding the best departure time that minim...
Bolin Ding, Jeffrey Xu Yu, Lu Qin
DOLAP
2004
ACM
16 years 5 days ago
A new OLAP aggregation based on the AHC technique
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...
Riadh Ben Messaoud, Omar Boussaid, Sabine Rabas&ea...
160
Voted
CVPR
2005
IEEE
16 years 8 months ago
Asymmetrical Occlusion Handling Using Graph Cut for Multi-View Stereo
Occlusion is usually modelled in two images symmetrically in previous stereo algorithms which cannot work for multi-view stereo efficiently. In this paper, we present a novel form...
Yichen Wei, Long Quan
IJCNN
2007
IEEE
16 years 1 months ago
3D-SE Viewer: A Text Mining Tool based on Bipartite Graph Visualization
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...
Shiro Usui, Antoine Naud, Naonori Ueda, Tatsuki Ta...
GD
2003
Springer
15 years 12 months ago
Track Drawings of Graphs with Constant Queue Number
A k-track drawing is a crossing-free 3D straight-line drawing of a graph G on a set of k parallel lines called tracks. The minimum value of k for which G admits a k-track drawing ...
Emilio Di Giacomo, Henk Meijer