2612 search results - page 140 / 523 » Assemblies as Graph Processes |
166
click to vote
GBRPR
2009
Springer
16 years 1 months ago
2009
Springer
A universal data model, named DG, is introduced to handle vectorized data uniformly during the whole recognition process. The model supports low level graph algorithms as well as h...
160
click to vote
ISMM
2009
Springer
16 years 1 months ago
2009
Springer
We study some basic morphological operators acting on the lattice of all subgraphs of a (non-weighted) graph G. To this end, we consider two dual adjunctions between the edge set a...
175
click to vote
RP
2010
Springer
15 years 4 months ago
2010
Springer
Efficient reachability query answering in large directed graphs has been intensively investigated because of its fundamental importance in many application fields such as XML data ...
155
click to vote
ICASSP
2008
IEEE
16 years 26 days ago
2008
IEEE
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
129
click to vote
OOPSLA
2005
Springer
15 years 12 months ago
2005
Springer
This paper describes the process used to extend the Boost Graph Library (BGL) for parallel operation with distributed memory. The BGL consists of a rich set of generic graph algor...