Sciweavers

557 search results - page 41 / 112
» Visualizing Weighted Edges in Graphs
Sort
View
ECAI
2008
Springer
15 years 26 days ago
Word Sense Induction Using Graphs of Collocations
Word Sense Induction (WSI) is the task of identifying the different senses (uses) of a target word in a given text. Traditional graph-based approaches create and then cluster a gra...
Ioannis P. Klapaftis, Suresh Manandhar
ESA
2005
Springer
176views Algorithms» more  ESA 2005»
15 years 4 months ago
On Degree Constrained Shortest Paths
Abstract. Traditional shortest path problems play a central role in both the design and use of communication networks and have been studied extensively. In this work, we consider a...
Samir Khuller, Kwangil Lee, Mark A. Shayman
SIAMCOMP
2010
133views more  SIAMCOMP 2010»
14 years 9 months ago
Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs
Let G = (V, E) be a weighted undirected graph having non-negative edge weights. An estimate ˆδ(u, v) of the actual distance δ(u, v) between u, v ∈ V is said to be of stretch t...
Surender Baswana, Telikepalli Kavitha
APVIS
2009
15 years 6 days ago
TugGraph: Path-preserving hierarchies for browsing proximity and paths in graphs
Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place the...
Daniel Archambault, Tamara Munzner, David Auber
74
Voted
TVCG
2011
100views more  TVCG 2011»
14 years 6 months ago
Tugging Graphs Faster: Efficiently Modifying Path-Preserving Hierarchies for Browsing Paths
—Many graph visualization systems use graph hierarchies to organize a large input graph into logical components. These approaches detect features globally in the data and place t...
Daniel Archambault, Tamara Munzner, David Auber