Sciweavers

755 search results - page 51 / 151
» Graph Transformation for Topology Modelling
Sort
View
PADS
2005
ACM
15 years 8 months ago
Simulating Realistic Packet Routing without Routing Protocols
A fundamental requirement for any network simulation environment is the realistic forwarding of packets from a source to a destination in the simulated topology. The routing decis...
George F. Riley, Dheeraj Reddy
IH
2007
Springer
15 years 9 months ago
A Graph Game Model for Software Tamper Protection
We present a probabilistic program-transformation algorithm to render a given program tamper-resistant. In addition, we suggest a model to estimate the required effort for an atta...
Nenad Dedic, Mariusz H. Jakubowski, Ramarathnam Ve...
GBRPR
2009
Springer
15 years 9 months ago
Computing and Visualizing a Graph-Based Decomposition for Non-manifold Shapes
Modeling and understanding complex non-manifold shapes is a key issue in shape analysis and retrieval. The topological structure of a non-manifold shape can be analyzed through its...
Leila De Floriani, Daniele Panozzo, Annie Hui
ICPR
2008
IEEE
16 years 4 months ago
Impulse noise removal by spectral clustering and regularization on graphs
In this paper we present a method for impulse noise removal that makes use of spectral clustering and graph regularization. The image is modeled as a graph and local spectral anal...
Olivier Lezoray, Vinh-Thong Ta, Abderrahim Elmoata...
ICDE
2005
IEEE
106views Database» more  ICDE 2005»
15 years 8 months ago
On Small World Graphs in Non-uniformly Distributed Key Spaces
In this paper we show that the topologies of most logarithmic-style P2P systems like Pastry, Tapestry or P-Grid resemble small-world graphs. Inspired by Kleinberg’s small-world ...
Sarunas Girdzijauskas, Anwitaman Datta, Karl Abere...