3105 search results - page 30 / 621 » The Path-Packing Structure of Graphs |
92
Voted
ICIP
2009
IEEE
16 years 1 months ago
2009
IEEE
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
114
Voted
CMOT
2004
15 years 13 days ago
2004
We describe a methodology to examine bipartite relational data structures as exemplified in networks of corporate interlocking. These structures can be represented as bipartite gr...
101
click to vote
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Graphs are powerful data structures that have many attractive properties for object representation. However, some basic operations are difficult to define and implement, for ins...
121
Voted
GFKL
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. The problem of clustering data can be formulated as a graph partitioning problem. In this setting, spectral methods for obtaining optimal solutions have received a lot of...
103
Voted
ICDT
1997
ACM
15 years 4 months ago
1997
ACM
We develop a new schema for unstructured data. Traditional schemas resemble the type systems of programming languages. For unstructured data, however, the underlying type may be mu...