Sciweavers

1830 search results - page 16 / 366
» Workshop on Graph Computation Models
Sort
View
CORR
2010
Springer
151views Education» more  CORR 2010»
13 years 6 months ago
Adding a referee to an interconnection network: What can(not) be computed in one round
Abstract—In this paper we ask which properties of a distributed network can be computed from a few amount of local information provided by its nodes. The distributed model we con...
Florent Becker, Martín Matamala, Nicolas Ni...
PODC
2009
ACM
14 years 8 months ago
Brief announcement: self-assembly as graph grammar as distributed system
In 2004, Klavins et al. introduced the use of graph grammars to describe--and to program--systems of self-assembly. It turns out that these graph grammars can be embedded in a gra...
Aaron Sterling
JAIR
2008
123views more  JAIR 2008»
13 years 7 months ago
The Computational Complexity of Dominance and Consistency in CP-Nets
We investigate the computational complexity of testing dominance and consistency in CP-nets. Up until now, the complexity of dominance has been determined only for restricted clas...
Judy Goldsmith, Jérôme Lang, Miroslaw...
SSD
2007
Springer
107views Database» more  SSD 2007»
14 years 1 months ago
Spatial Partition Graphs: A Graph Theoretic Model of Maps
The notion of a map is a fundamental metaphor in spatial disciplines. However, there currently exist no adequate data models for maps that define a precise spatial data type for m...
Mark McKenney, Markus Schneider
SBBD
2007
116views Database» more  SBBD 2007»
13 years 9 months ago
A Hypergraph Model for Computing Page Reputation on Web Collections
In this work we propose a representation of the web as a directed hypergraph, instead of a graph, where links can connect not only pairs of pages, but also pairs of disjoint sets o...
Klessius Berlt, Edleno Silva de Moura, André...