Sciweavers

1493 search results - page 225 / 299
» Local resilience of graphs
Sort
View
IPPS
2007
IEEE
14 years 2 months ago
Implementing Hirschberg's PRAM-Algorithm for Connected Components on a Global Cellular Automaton
The GCA (Global Cellular Automata) model consists of a collection of cells which change their states synchronously depending on the states of their neighbors like in the classical...
Johannes Jendrsczok, Rolf Hoffmann, Jörg Kell...
LION
2007
Springer
138views Optimization» more  LION 2007»
14 years 2 months ago
A Continuous Characterization of Maximal Cliques in k-Uniform Hypergraphs
Abstract. In 1965 Motzkin and Straus established a remarkable connection between the local/global maximizers of the Lagrangian of a graph G over the standard simplex ∆ and the ma...
Samuel Rota Bulò, Marcello Pelillo
COMPLIFE
2005
Springer
14 years 1 months ago
The Architecture of a Proteomic Network in the Yeast
Abstract. We describe an approach to clustering the yeast protein-protein interaction network in order to identify functional modules, groups of proteins forming multi-protein comp...
Emad Ramadan, Christopher Osgood, Alex Pothen
IPSN
2005
Springer
14 years 1 months ago
Coverage and hole-detection in sensor networks via homology
We consider coverage problems in sensor networks of stationary nodes with minimal geometric data. In particular, there are no coordinates and no localization of nodes. We introduc...
Robert Ghrist, Abubakr Muhammad
SIGECOM
2004
ACM
134views ECommerce» more  SIGECOM 2004»
14 years 1 months ago
Computing approximate bayes-nash equilibria in tree-games of incomplete information
We provide efficient algorithms for finding approximate BayesNash equilibria (BNE) in graphical, specifically tree, games of incomplete information. In such games an agent’s p...
Satinder P. Singh, Vishal Soni, Michael P. Wellman