16 search results - page 2 / 4 » Multicut Algorithms via Tree Decompositions |
PODC
2010
ACM
13 years 9 months ago
2010
ACM
We show how to partition data structures representable by directed acyclic graphs, i.e. rooted trees, to allow for efficient complex operations, which lie beyond inserts, deletes ...
ICIP
2008
IEEE
14 years 7 months ago
2008
IEEE
This paper proposes a data driven image segmentation algorithm, based on decomposing the target output (ground truth). Classical pixel labeling methods utilize machine learning al...
ICIP
2004
IEEE
14 years 7 months ago
2004
IEEE
The binary set splitting with k-d trees (BISK) algorithm is introduced. An embedded wavelet-based image coder based on the popular bitplane-coding paradigm, BISK is designed speci...
SIAMCOMP
1998
13 years 5 months ago
1998
This paper describes new methods for maintaining a point-location data structure for a dynamically changing monotone subdivision S. The main approach is based on the maintenance of...
WWW
2008
ACM
14 years 6 months ago
2008
ACM
Hierarchical topic taxonomies have proliferated on the World Wide Web [5, 18], and exploiting the output space decompositions they induce in automated classification systems is an...