1951 search results - page 101 / 391 » An algorithm for improving graph partitions |
145
click to vote
ISPD
2010
ACM
15 years 11 months ago
2010
ACM
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
140
click to vote
STACS
2010
Springer
15 years 11 months ago
2010
Springer
Reachability and shortest path problems are NL-complete for general graphs. They are known to be in L for graphs of tree-width 2 [14]. However, for graphs of treewidth larger than ...
163
click to vote
ICIP
2008
IEEE
15 years 11 months ago
2008
IEEE
Text segmentation, or named text binarization, is usually an essential step for text information extraction from images and videos. However, most existing text segmentation method...
134
Voted
ADC
2007
Springer
15 years 10 months ago
2007
Springer
Recently, privacy issues have become important in clustering analysis, especially when data is horizontally partitioned over several parties. Associative queries are the core retr...
112
click to vote
ESA
2009
Springer
15 years 11 months ago
2009
Springer
Abstract. In this paper, we show that algorithms on tree decompositions can be made faster with the use of generalisations of fast subset convolution. Amongst others, this gives al...