Sciweavers

1076 search results - page 158 / 216
» The Aesthetics of Graph Visualization
Sort
View
VL
1995
IEEE
121views Visual Languages» more  VL 1995»
15 years 1 months ago
Buffering of Intermediate Results in Dataflow Diagrams
Buffering of intermediate results in dataflow diagrams can significantly reduce latency when a user browses these results or re-executes a diagram with slightly different inputs. ...
Allison Woodruff, Michael Stonebraker
KES
2010
Springer
14 years 8 months ago
Extracting a Keyword Network of Flood Disaster Measures
For rapid and effective recovery from a flood disaster, an anti-disaster headquarters must not only assess the extent of damage, but also possess overall knowledge of the possibl...
Motoki Miura, Mitsuhiro Tokuda, Daiki Kuwahara
IJCV
2006
299views more  IJCV 2006»
14 years 9 months ago
Graph Cuts and Efficient N-D Image Segmentation
Combinatorial graph cut algorithms have been successfully applied to a wide range of problems in vision and graphics. This paper focusses on possibly the simplest application of gr...
Yuri Boykov, Gareth Funka-Lea
ICDM
2010
IEEE
230views Data Mining» more  ICDM 2010»
14 years 7 months ago
Clustering Large Attributed Graphs: An Efficient Incremental Approach
In recent years, many networks have become available for analysis, including social networks, sensor networks, biological networks, etc. Graph clustering has shown its effectivenes...
Yang Zhou, Hong Cheng, Jeffrey Xu Yu
PAMI
2010
103views more  PAMI 2010»
14 years 8 months ago
The Sum-over-Paths Covariance Kernel: A Novel Covariance Measure between Nodes of a Directed Graph
—This work introduces a link-based covariance measure between the nodes of a weighted directed graph where a cost is associated to each arc. To this end, a probability distributi...
Amin Mantrach, Luh Yen, Jérôme Callut...