Sciweavers

596 search results - page 81 / 120
» Complexity Analysis by Graph Rewriting
Sort
View
SIGECOM
2009
ACM
112views ECommerce» more  SIGECOM 2009»
14 years 2 months ago
Network bargaining: algorithms and structural results
We consider models for bargaining in social networks, in which players are represented by vertices and edges represent bilateral opportunities for deals between pairs of players. ...
Tanmoy Chakraborty, Michael Kearns, Sanjeev Khanna
PPOPP
2005
ACM
14 years 1 months ago
A linear-time algorithm for optimal barrier placement
We want to perform compile-time analysis of an SPMD program and place barriers in it to synchronize it correctly, minimizing the runtime cost of the synchronization. This is the b...
Alain Darte, Robert Schreiber
IWPC
2002
IEEE
14 years 1 months ago
Building Program Understanding Tools Using Visitor Combinators
Program understanding tools manipulate program represensuch as abstract syntax trees, control-flow graphs, or data-flow graphs. This paper deals with the use of visitor combinat...
Arie van Deursen, Joost Visser
WAW
2004
Springer
178views Algorithms» more  WAW 2004»
14 years 1 months ago
Communities Detection in Large Networks
We develop an algorithm to detect community structure in complex networks. The algorithm is based on spectral methods and takes into account weights and links orientations. Since t...
Andrea Capocci, Vito Domenico Pietro Servedio, Gui...
RECOMB
2006
Springer
14 years 8 months ago
Assessing Significance of Connectivity and Conservation in Protein Interaction Networks
Computational and comparative analysis of protein-protein interaction (PPI) networks enable understanding of the modular organization of the cell through identification of functio...
Mehmet Koyutürk, Ananth Grama, Wojciech Szpan...