363 search results - page 44 / 73 » Partial Multicuts in Trees |
128
click to vote
SPIRE
2009
Springer
15 years 11 months ago
2009
Springer
We introduce a symbol reordering technique that implicitly synchronizes variable-length codes, such that it is possible to directly access the i-th codeword without need of any sam...
135
Voted
CRV
2006
IEEE
15 years 11 months ago
2006
IEEE
A method is proposed to detect multi-part man-made or natural objects in complex images. It consists in first extracting simple curves and straight lines from the edge map. Then,...
123
click to vote
RR
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. Good tree search algorithms are a key requirement for inference engines of rule languages. As Prolog exemplifies, inference engines based on traditional uninformed searc...
170
Voted
ECSQARU
1999
Springer
15 years 9 months ago
1999
Springer
Abstract. Given several Dempster-Shafer belief functions, the framework of valuation networks describes an efficient method for computing the marginal of the combined belief functi...
141
Voted
WG
1997
Springer
15 years 9 months ago
1997
Springer
In this paper we present a parallel algorithm that decides whether a graph G has treewidth at most two, and if so, construct a tree decomposition or path decomposition of minimum ...