Sciweavers

866 search results - page 60 / 174
» Bidirectionalizing graph transformations
Sort
View
BTW
2001
Springer
103views Database» more  BTW 2001»
15 years 2 months ago
On Realizing Transformation Independence in Open, Distributed Multimedia Information Systems
In this article, we present our efforts1 on realizing transformation independence in open, extensible, and highly distributed multimedia information The main focus is on the abstra...
Ulrich Marder
ICPR
2006
IEEE
15 years 11 months ago
Graph-based transformation manifolds for invariant pattern recognition with kernel methods
We present here an approach for applying the technique of modeling data transformation manifolds for invariant learning with kernel methods. The approach is based on building a ke...
Alexei Pozdnoukhov, Samy Bengio
AUTOMATICA
2004
91views more  AUTOMATICA 2004»
14 years 9 months ago
Comparing digital implementation via the bilinear and step-invariant transformations
From an analog system K, digital systems Kd and Kbt are often obtained via the step-invariant and bilinear transformations, respectively. For the case when K is stable, it is show...
Guofeng Zhang, Tongwen Chen
DIS
2007
Springer
15 years 1 months ago
Time and Space Efficient Discovery of Maximal Geometric Graphs
A geometric graph is a labeled graph whose vertices are points in the 2D plane with an isomorphism invariant under geometric transformations such as translation, rotation, and scal...
Hiroki Arimura, Takeaki Uno, Shinichi Shimozono
ICPR
2008
IEEE
15 years 4 months ago
Constrained clustering by a novel graph-based distance transformation
In this work we present a novel method to model instance-level constraints within a clustering algorithm. Thereby, both similarity and dissimilarity constraints can be used coeval...
Kai Rothaus, Xiaoyi Jiang