Sciweavers

1395 search results - page 171 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
CPHYSICS
2006
124views more  CPHYSICS 2006»
14 years 10 months ago
Collision-free spatial hash functions for structural analysis of billion-vertex chemical bond networks
State-of-the-art molecular dynamics (MD) simulations generate massive datasets involving billion-vertex chemical bond networks, which makes data mining based on graph algorithms s...
Cheng Zhang, Bhupesh Bansal, Paulo S. Branicio, Ra...
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
14 years 9 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...
SIAMDM
1998
55views more  SIAMDM 1998»
14 years 9 months ago
Multiple Capacity Vehicle Routing on Paths
Consider the problem of transporting a set of objects between the vertices of a simple graph by a vehicle that traverses the edges of the graph. The problem of finding a shortest...
D. J. Guan, Xuding Zhu
CIKM
2010
Springer
14 years 8 months ago
Evaluating, combining and generalizing recommendations with prerequisites
We consider the problem of recommending the best set of k items when there is an inherent ordering between items, expressed as a set of prerequisites (e.g., the movie ‘Godfather...
Aditya G. Parameswaran, Hector Garcia-Molina, Jeff...
PVLDB
2010
116views more  PVLDB 2010»
14 years 4 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...