Sciweavers

6598 search results - page 287 / 1320
» Graph Theory with Applications
Sort
View
PODC
2009
ACM
16 years 7 months ago
Coloring unstructured wireless multi-hop networks
We present a randomized coloring algorithm for the unstructured radio network model, a model comprising autonomous nodes, asynchronous wake-up, no collision detection and an unkno...
Johannes Schneider, Roger Wattenhofer
SODA
2010
ACM
261views Algorithms» more  SODA 2010»
16 years 4 months ago
Bidimensionality and Kernels
Bidimensionality theory appears to be a powerful framework in the development of meta-algorithmic techniques. It was introduced by Demaine et al. [J. ACM 2005 ] as a tool to obtai...
Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, ...
ICCS
2009
Springer
16 years 1 months ago
Hiding Communication Latency with Non-SPMD, Graph-Based Execution
Reformulating an algorithm to mask communication delays is crucial in maintaining scalability, but traditional solutions embed the overlap strategy into the application. We present...
Jacob Sorensen, Scott B. Baden
SC
2009
ACM
16 years 1 months ago
Evaluating use of data flow systems for large graph analysis
Large graph analysis has become increasingly important and is widely used in many applications such as web mining, social network analysis, biology, and information retrieval. The...
Andy Yoo, Ian Kaplan
ETFA
2008
IEEE
16 years 1 months ago
Automatic generation of bond graph models of process plants
This paper presents an application for the automatic generation of Bond Graph models. The basis for this automated creation is a modified plant model in the XML-format according t...
Sebastian Beez, Alexander Fay, Nina F. Thornhill