363 search results - page 28 / 73 » Partial Multicuts in Trees |
KDD
1995
ACM
14 years 1 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...
FAW
2008
Springer
13 years 11 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 ...
26
Voted
JPDC
2006
13 years 9 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...
ICPR
2006
IEEE
14 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, ...
ATVA
2006
Springer
14 years 1 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...