332 search results - page 48 / 67 » Complexity analysis of a decentralised graph colouring algor... |
PLDI
2004
ACM
14 years 1 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
IPSN
2009
Springer
14 years 2 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Borrowing from concepts in expander graphs, we study the expansion properties of real-world, complex networks (e.g. social networks, unstructured peer-to-peer or P2P networks) and...
AOSD
2008
ACM
13 years 9 months ago
2008
ACM
Aspect-oriented software presents new challenges for the designers of static analyses. Our work aims to establish systematic foundations for dataflow analysis of AspectJ software....
CISS
2008
IEEE
13 years 7 months ago
2008
IEEE
Abstract-- When monitoring interactions within a social network, meetings or contacts between different members of the network are recorded. This paper addresses the problem of usi...