Sciweavers

1830 search results - page 36 / 366
» Workshop on Graph Computation Models
Sort
View
LAWEB
2003
IEEE
14 years 29 days ago
Clustering the Chilean Web
We perform a clustering of the Chilean Web Graph using a local fitness measure, optimized by simulated annealing, and compare the obtained cluster distribution to that of two mod...
Satu Virtanen
STOC
2010
ACM
211views Algorithms» more  STOC 2010»
14 years 16 days ago
Distributed Computation in Dynamic Networks
In this paper we investigate distributed computation in dynamic networks in which the network topology changes from round to round. We consider a worst-case model in which the com...
Fabian Kuhn, Nancy Lynch and Rotem Oshman
DATE
2005
IEEE
118views Hardware» more  DATE 2005»
14 years 1 months ago
An Iterative Algorithm for Battery-Aware Task Scheduling on Portable Computing Platforms
In this work we consider battery powered portable systems which either have Field Programmable Gate Arrays (FPGA) or voltage and frequency scalable processors as their main proces...
Jawad Khan, Ranga Vemuri
BMCBI
2011
13 years 2 months ago
Hierarchical graphs for rule-based modeling of biochemical systems
Background: In rule-based modeling, graphs are used to represent molecules: a colored vertex represents a component of a molecule, a vertex attribute represents the internal state...
Nathan W. Lemons, Bin Hu, William S. Hlavacek
GD
2005
Springer
14 years 1 months ago
Dynamic Spectral Layout of Small Worlds
Spectral methods are naturally suited for dynamic graph layout, because moderate changes of a graph yield moderate changes of the layout under weak assumptions. We discuss some gen...
Ulrik Brandes, Daniel Fleischer, Thomas Puppe