341 search results - page 6 / 69 » Paired bondage in trees |
ICIP
2002
IEEE
15 years 13 days ago
2002
IEEE
In this paper a fully automatic system for embedding visually recognizable watermark patterns to video objects is proposed. The architecture consists of 3 main modules. During the...
NAACL
2010
13 years 8 months ago
2010
We describe tree edit models for representing sequences of tree transformations involving complex reordering phenomena and demonstrate that they offer a simple, intuitive, and eff...
WEA
2010
Springer
14 years 5 months ago
2010
Springer
Let P be a set of points in Rd . We propose GEOFILTERKRUSKAL, an algorithm that computes the minimum spanning tree of P using well separated pair decomposition in combination with ...
ICDE
2000
IEEE
15 years 6 days ago
2000
IEEE
Most decision tree classifiers are designed to keep class histograms for single attributes, and to select a particular attribute for the next split using said histograms. In this ...
IWOCA
2010
Springer
13 years 5 months ago
2010
Springer
A homomorphism from a graph G to a graph R is locally surjective if its restriction to the neighborhood of each vertex of G is surjective. Such a homomorphism is also called an R-r...