Sciweavers

1274 search results - page 171 / 255
» Graph lambda theories
Sort
View
SPAA
2010
ACM
14 years 1 months ago
Fast distributed approximation algorithms for vertex cover and set cover in anonymous networks
We present a distributed algorithm that finds a maximal edge packing in O(∆ + log∗ W) synchronous communication rounds in a weighted graph, independent of the number of nodes...
Matti Åstrand, Jukka Suomela
CVPR
2000
IEEE
14 years 1 months ago
Geodesic Distance Evolution of Surfaces: A New Method for Matching Surfaces
The general problem of surface matching is taken up in this study. The process described in this work hinges on a geodesic distance equation for a family of surfaces embedded in t...
Hussein M. Yahia, Etienne G. Huot, Isabelle Herlin...
ICPP
2000
IEEE
14 years 1 months ago
Domination and Its Applications in Ad Hoc Wireless Networks with Unidirectional Links
We consider an efficient distributed algorithm for determining a dominating and absorbant set of vertices (mobile hosts) in a given directed graph that represents an ad hoc wirel...
Jie Wu, Hailan Li
FOAL
2009
ACM
14 years 25 days ago
Graph-based specification and simulation of featherweight Java with around advice
In this paper we specify an operational run-time semantics of Assignment Featherweight Java -- a minimal subset of Java with assignments -- with around advice, using graph transfo...
Tom Staijen, Arend Rensink
HT
1991
ACM
14 years 14 days ago
Identifying Aggregates in Hypertext Structures
Hypertext systems are being used in many applications because of their flexible structure and the great browsing freedom they give to diverse communities of users. However, this s...
Rodrigo A. Botafogo, Ben Shneiderman