1447 search results - page 100 / 290 » Graphs and Path Equilibria |
129
click to vote
GBRPR
2009
Springer
15 years 10 months ago
2009
Springer
A large family of shape comparison methods is based on a medial axis transform combined with an encoding of the skeleton by a graph. Despite many qualities this encoding of shapes ...
123
click to vote
GD
2004
Springer
15 years 9 months ago
2004
Springer
We describe the query and data processing language QUOGGLES which is particularly designed for the application on graphs. It uses a pipeline-like technique known from command line ...
119
click to vote
CORR
2007
Springer
15 years 4 months ago
2007
Springer
Graphs are called navigable if one can find short paths through them using only local knowledge. It has been shown that for a graph to be navigable, its construction needs to mee...
149
click to vote
ICAI
2010
15 years 2 months ago
2010
Belief propagation is widely used in inference of graphical models. It yields exact solutions when the underlying graph is singly connected. When the graph contains loops, double-c...
165
click to vote
BCB
2010
14 years 11 months ago
2010
Growing sequencing and assembly efforts have been met by the advances in high throughput machines. However, the presence of massive amounts of repeats and transposons complicates ...