2314 search results - page 112 / 463 » Minimal Partitions of a Graph |
142
Voted
EMMCVPR
2011
Springer
14 years 3 months ago
2011
Springer
Variational relaxations can be used to compute approximate minimizers of optimal partitioning and multiclass labeling problems on continuous domains. While the resulting relaxed co...
221
Voted
ICDE
2004
IEEE
16 years 5 months ago
2004
IEEE
XML and other types of semi-structured data are typically represented by a labeled directed graph. To speed up path expression queries over the graph, a variety of structural inde...
153
Voted
CVPR
2005
IEEE
16 years 5 months ago
2005
IEEE
We present a multiscale spectral image segmentation algorithm. In contrast to most multiscale image processing, this algorithm works on multiple scales of the image in parallel, w...
238
Voted
ICDE
2006
IEEE
16 years 5 months ago
2006
IEEE
Efficient indexing techniques have been developed for the exact and approximate substructure search in large scale graph databases. Unfortunately, the retrieval problem of structu...
113
Voted
ICDE
2010
IEEE
15 years 3 months ago
2010
IEEE
A way to optimize performance of relational row store databases is to reduce the row widths by vertically partitioning tables into table fractions in order to minimize the number ...