1402 search results - page 57 / 281 » Searching Cycle-Disjoint Graphs |
CIKM
2010
Springer
14 years 4 months ago
2010
Springer
The gap between the user's information need and query is expanding due to the pervasiveness of Web search. Multimedia question answering is restricted by disjoint infrastruct...
103
click to vote
ICDE
2010
IEEE
15 years 3 months ago
2010
IEEE
— Finding decompositions of a graph into a family of clusters is crucial to understanding its underlying structure. While most existing approaches focus on partitioning the nodes...
ICPR
2008
IEEE
15 years 4 months ago
2008
IEEE
In online handwritten math expression recognition, one-pass dynamic programming can produce highquality symbol graphs in addition to best symbol sequence hypotheses [3], especiall...
SBP
2011
Springer
14 years 4 months ago
2011
Springer
Given a network, we are interested in ranking sets of nodes that score highest on user-specified criteria. For instance in graphs from bibliographic data (e.g. PubMed), we would l...
BMVC
2001
15 years 7 days ago
2001
This paper describes a spectral method for graph-matching. We adopt a graphical models viewpoint in which the graph adjacency matrix is taken to represent the transition probabili...