Sciweavers

4865 search results - page 652 / 973
» The Complexity of Graph Connectivity
Sort
View
OTM
2007
Springer
16 years 8 days ago
Decentralised Commitment for Optimistic Semantic Replication
Abstract. We study large-scale distributed cooperative systems that use optimistic replication. We represent a system as a graph of actions (operations) connected by edges that rei...
Pierre Sutra, João Barreto, Marc Shapiro
162
Voted
WABI
2007
Springer
16 years 7 days ago
Topology Independent Protein Structural Alignment
Abstract. Protein structural alignment is an indispensable tool used for many different studies in bioinformatics. Most structural alignment algorithms assume that the structural ...
Joe Dundas, T. Andrew Binkowski, Bhaskar DasGupta,...
AICT
2006
IEEE
16 years 6 days ago
Optimal Solution of the Maximum All Request Path Grooming Problem
— We give an optimal solution to the Maximum All Request Path Grooming (MARPG) problem motivated by a traffic grooming application. The MARPG problem consists in finding the ma...
Jean-Claude Bermond, Michel Cosnard, David Coudert...
160
Voted
BIBE
2006
IEEE
160views Bioinformatics» more  BIBE 2006»
16 years 6 days ago
Methods for Random Modularization of Biological Networks
— Biological networks are formalized summaries of our knowledge about interactions among biological system components, like genes, proteins, or metabolites. From their global top...
Zachary M. Saul, Vladimir Filkov
FOCS
2006
IEEE
16 years 6 days ago
On a Geometric Generalization of the Upper Bound Theorem
We prove an upper bound, tight up to a factor of 2, for the number of vertices of level at most in an arrangement of n halfspaces in Rd , for arbitrary n and d (in particular, the...
Uli Wagner