Sciweavers

3396 search results - page 279 / 680
» Tree representations of graphs
Sort
View
CIDM
2007
IEEE
15 years 10 months ago
Efficient Kernel-based Learning for Trees
Kernel methods are effective approaches to the modeling of structured objects in learning algorithms. Their major drawback is the typically high computational complexity of kernel ...
Fabio Aiolli, Giovanni Da San Martino, Alessandro ...
ICCAD
1999
IEEE
120views Hardware» more  ICCAD 1999»
15 years 10 months ago
Regularity extraction via clan-based structural circuit decomposition
Identifying repeating structural regularities in circuits allows the minimization of synthesis, optimization, and layout e orts. We introduce in this paper a novel method for ident...
Soha Hassoun, Carolyn McCreary
PODC
1990
ACM
15 years 10 months ago
Self-Stabilization of Dynamic Systems Assuming only Read/Write Atomicity
Three self-stabilizing protocols for distributed systems in the shared memory model are presented. The first protocol is a mutual exclusion protocol for tree structured systems. T...
Shlomi Dolev, Amos Israeli, Shlomo Moran
FSTTCS
2010
Springer
15 years 4 months ago
First-Order Logic with Reachability Predicates on Infinite Systems
This paper focuses on first-order logic (FO) extended by reachability predicates such that the expressiveness and hence decidability properties lie between FO and monadic second-o...
Stefan Schulz
ACSC
2007
IEEE
16 years 10 days ago
From Graphs to Euclidean Virtual Worlds: Visualization of 3D Electronic Institutions
In this paper we propose an algorithm for automatic transformation of a graph into a 3D Virtual World and its Euclidean map, using the rectangular dualization technique. The nodes...
Sara Drago, Anton Bogdanovych, Massimo Ancona, Sim...