Sciweavers

126 search results - page 17 / 26
» Consistent graph layout for weighted graphs
Sort
View
SSPR
1998
Springer
14 years 20 days ago
Object Recognition from Large Structural Libraries
This paper presents a probabilistic similarity measure for object recognition from large libraries of line-patterns. We commence from a structural pattern representation which use...
Benoit Huet, Edwin R. Hancock
SWAT
1998
Springer
108views Algorithms» more  SWAT 1998»
14 years 20 days ago
Formal Language Constrained Path Problems
Given an alphabet , a (directed) graph G whose edges are weighted and -labeled, and a formal language L , the formal-language-constrained shortest/simple path problem consists of ...
Christopher L. Barrett, Riko Jacob, Madhav V. Mara...
AAAI
2011
12 years 8 months ago
Exploiting Phase Transition in Latent Networks for Clustering
In this paper, we model the pair-wise similarities of a set of documents as a weighted network with a single cutoff parameter. Such a network can be thought of an ensemble of unwe...
Vahed Qazvinian, Dragomir R. Radev
TVCG
2008
134views more  TVCG 2008»
13 years 8 months ago
Balloon Focus: a Seamless Multi-Focus+Context Method for Treemaps
The treemap is one of the most popular methods for visualizing hierarchical data. When a treemap contains a large number of items, inspecting or comparing a few selected items in a...
Ying Tu, Han-Wei Shen
PODC
2006
ACM
14 years 2 months ago
Optimal-stretch name-independent compact routing in doubling metrics
We consider the problem of name-independent routing in doubling metrics. A doubling metric is a metric space whose doubling dimension is a constant, where the doubling dimension o...
Goran Konjevod, Andréa W. Richa, Donglin Xi...