Sciweavers

557 search results - page 64 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
SPAA
2010
ACM
15 years 4 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
IV
2009
IEEE
191views Visualization» more  IV 2009»
15 years 5 months ago
An Heuristic for the Construction of Intersection Graphs
Most methods for generating Euler diagrams describe the detection of the general structure of the final draw as the first and most important step. This information is often depi...
Paolo Simonetto, David Auber
DAGSTUHL
2011
13 years 11 months ago
Feature Extraction for DW-MRI Visualization: The State of the Art and Beyond
By measuring the anisotropic self-diffusion rates of water, Diffusion Weighted Magnetic Resonance Imaging (DW-MRI) provides a unique noninvasive probe of fibrous tissue. In par...
Thomas Schultz
SMC
2007
IEEE
111views Control Systems» more  SMC 2007»
15 years 5 months ago
Towards Visual Exploration of Topic Shifts
— This paper presents two approaches to visually analyze the topic shift of a pool of documents over a given period of time. The first of the proposed methods is based on a mult...
Kilian Thiel, Fabian Dill, Tobias Kötter, Mic...
ESA
2007
Springer
115views Algorithms» more  ESA 2007»
15 years 5 months ago
Approximation of Partial Capacitated Vertex Cover
We study the partial capacitated vertex cover problem (pcvc) in which the input consists of a graph G and a covering requirement L. Each edge e in G is associated with a demand (o...
Reuven Bar-Yehuda, Guy Flysher, Julián Mest...