Sciweavers

803 search results - page 128 / 161
» Independence in Direct-Product Graphs
Sort
View
CN
2008
98views more  CN 2008»
13 years 8 months ago
Description and simulation of dynamic mobility networks
During the last decade, the study of large scale complex networks has attracted a substantial amount of attention and works from several domains: sociology, biology, computer scie...
Antoine Scherrer, Pierre Borgnat, Eric Fleury, Jea...
COMGEO
2006
ACM
13 years 8 months ago
Computing homotopic shortest paths efficiently
Geometric shortest paths are a major topic in computational geometry; see the survey paper by Mitchell [12]. A shortest path between two points in a simple polygon can be found in...
Alon Efrat, Stephen G. Kobourov, Anna Lubiw
BMCBI
2005
253views more  BMCBI 2005»
13 years 8 months ago
The Use of Edge-Betweenness Clustering to Investigate Biological Function in Protein Interaction Networks
Background: This paper describes an automated method for finding clusters of interconnected proteins in protein interaction networks and retrieving protein annotations associated ...
Ruth Dunn, Frank Dudbridge, Christopher M. Sanders...
PVLDB
2010
116views more  PVLDB 2010»
13 years 3 months ago
Schism: a Workload-Driven Approach to Database Replication and Partitioning
We present Schism, a novel workload-aware approach for database partitioning and replication designed to improve scalability of sharednothing distributed databases. Because distri...
Carlo Curino, Yang Zhang, Evan P. C. Jones, Samuel...
STOC
2009
ACM
145views Algorithms» more  STOC 2009»
14 years 9 months ago
Finding, minimizing, and counting weighted subgraphs
d Abstract] Virginia Vassilevska School of Mathematics Institute for Advanced Study Princeton, NJ 08540 USA virgi@math.ias.edu Ryan Williams School of Mathematics Institute for Adv...
Virginia Vassilevska, Ryan Williams