Sciweavers

755 search results - page 75 / 151
» Graph Transformation for Topology Modelling
Sort
View
DCOSS
2005
Springer
14 years 2 months ago
Stably Computable Properties of Network Graphs
We consider a scenario in which anonymous, finite-state sensing devices are deployed in an ad-hoc communication network of arbitrary size and unknown topology, and explore what p...
Dana Angluin, James Aspnes, Melody Chan, Michael J...
CVPR
2008
IEEE
14 years 10 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...
PG
2003
IEEE
14 years 2 months ago
A State Machine for Real-Time Cutting of Tetrahedral Meshes
We introduce an algorithm that consistently and accurately processes arbitrary intersections in tetrahedral meshes in real-time. The intersection surfaces are modeled up to the cu...
Daniel Bielser, Pascal Glardon, Matthias Teschner,...
CIKM
2009
Springer
14 years 3 months ago
A query language for analyzing networks
With more and more large networks becoming available, mining and querying such networks are increasingly important tasks which are not being supported by database models and query...
Anton Dries, Siegfried Nijssen, Luc De Raedt
ICALP
2009
Springer
14 years 3 months ago
Quasirandom Rumor Spreading: Expanders, Push vs. Pull, and Robustness
Abstract Randomized rumor spreading is an efficient protocol to distribute information in networks. Recently, a quasirandom version has been proposed and proven to work equally we...
Benjamin Doerr, Tobias Friedrich, Thomas Sauerwald