Sciweavers

776 search results - page 14 / 156
» Network Applications of Graph Bisimulation
Sort
View
ISCC
2006
IEEE
127views Communications» more  ISCC 2006»
14 years 4 months ago
Visualizing and Managing Network Topologies via Rectangular Dualization
Rectangular dualization is an effective, hierarchically oriented visualization method for network topologies and can be used in many other problems having in common with networks ...
Massimo Ancona, Walter Cazzola, Sara Drago, Gianlu...
OL
2011
242views Neural Networks» more  OL 2011»
13 years 5 months ago
On connected domination in unit ball graphs
Given a simple undirected graph, the minimum connected dominating set problem is to find a minimum cardinality subset of vertices D inducing a connected subgraph such that each ve...
Sergiy Butenko, Sera Kahruman-Anderoglu, Oleksii U...
ICANN
2007
Springer
14 years 4 months ago
Unbiased SVM Density Estimation with Application to Graphical Pattern Recognition
Abstract. Classification of structured data (i.e., data that are represented as graphs) is a topic of interest in the machine learning community. This paper presents a different,...
Edmondo Trentin, Ernesto Di Iorio
WWW
2004
ACM
14 years 11 months ago
Towards the composition of Ad Hoc B2B Applications: Semantics, Properties and Complexity Management
The goal is to build a general framework for ad hoc applications over large networks using semantics and complex systems analysis. The first part deals with semantics because appl...
Jaime Delgado, Rosa Gil, Zièd Choukair
SPAA
2009
ACM
14 years 5 months ago
Weak graph colorings: distributed algorithms and applications
We study deterministic, distributed algorithms for two weak variants of the standard graph coloring problem. We consider defective colorings, i.e., colorings where nodes of a colo...
Fabian Kuhn