363 search results - page 28 / 73 » Partial Multicuts in Trees |
171
click to vote
KDD
1995
ACM
15 years 10 months ago
1995
ACM
Finding and removingoutliers is an important problem in data mining. Errors in large databases can be extremely common,so an important property of a data mining algorithm is robus...
179
click to vote
FAW
2008
Springer
15 years 8 months ago
2008
Springer
We propose path-merging as a refinement of techniques used to make linked data structures partially persistent. Path-merging supports bursts of operations between any two adjacent ...
144
click to vote
JPDC
2006
15 years 6 months ago
2006
A fully unsafe hypercube according to the global safety can be split into a unique set of maximal safe subcubes. Multicasting in a maximal safe subcube can be completed reliably b...
147
click to vote
ICPR
2006
IEEE
16 years 7 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, ...
154
click to vote
ATVA
2006
Springer
15 years 10 months ago
2006
Springer
We present the implementation of the trace theory in a new model checking tool framework, POEM, that has a strong emphasis on Partial Order Methods. A tree structure is used to sto...