Sciweavers

806 search results - page 87 / 162
» An Optimal Dynamic Data Structure for Stabbing-Semigroup Que...
Sort
View
PVLDB
2010
190views more  PVLDB 2010»
14 years 8 months ago
Efficient B-tree Based Indexing for Cloud Data Processing
A Cloud may be seen as a type of flexible computing infrastructure consisting of many compute nodes, where resizable computing capacities can be provided to different customers. T...
Sai Wu, Dawei Jiang, Beng Chin Ooi, Kun-Lung Wu
CIDR
2011
274views Algorithms» more  CIDR 2011»
14 years 5 months ago
Cloud Resource Orchestration: A Data-Centric Approach
Cloud computing provides users near instant access to seemingly unlimited resources, and provides service providers the opportunity to deploy complex information technology infras...
Yun Mao, Changbin Liu, Jacobus E. van der Merwe, M...
SIAMCOMP
1998
85views more  SIAMCOMP 1998»
15 years 1 months ago
Separator-Based Sparsification II: Edge and Vertex Connectivity
We consider the problem of maintaining a dynamic planar graph subject to edge insertions and edge deletions that preserve planarity but that can change the embedding. We describe a...
David Eppstein, Zvi Galil, Giuseppe F. Italiano, T...
ICDE
2006
IEEE
127views Database» more  ICDE 2006»
16 years 2 months ago
Indexing for Dynamic Abstract Regions
for Dynamic Abstract Regions Joxan Jaffar Roland H.C. Yap School of Computing National University of Singapore 3 Science Drive 2, 117543, Singapore {joxan, ryap}@comp.nus.edu.sg Ke...
Joxan Jaffar, Roland H. C. Yap, Kenny Qili Zhu
CPHYSICS
2006
124views more  CPHYSICS 2006»
15 years 1 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...