Sciweavers

299 search results - page 10 / 60
» On Graph Query Optimization in Large Networks
Sort
View
SIGMOD
2010
ACM
255views Database» more  SIGMOD 2010»
15 years 4 months ago
Large graph processing in the cloud
As the study of graphs, such as web and social graphs, becomes increasingly popular, the requirements of efficiency and programming flexibility of large graph processing tasks c...
Rishan Chen, Xuetian Weng, Bingsheng He, Mao Yang
ATMOS
2008
15 years 1 months ago
Engineering Time-Expanded Graphs for Faster Timetable Information
We present an extension of the well-known time-expanded approach for timetable information. By remodeling unimportant stations, we are able to obtain faster query times with less s...
Daniel Delling, Thomas Pajor, Dorothea Wagner
COMAD
2009
15 years 23 days ago
On the Complexity of Multi-Query Optimization in Stream Grids
Stream grids are wide-area grid computing environments that are fed by a set of stream data sources. Such grids are becoming more wide-spread due to the large scale deployment of ...
Saikat Mukherjee, Srinath Srinivasa, Krithi Ramamr...
ESAS
2006
Springer
15 years 3 months ago
On Optimality of Key Pre-distribution Schemes for Distributed Sensor Networks
We derive the optimality results for key pre distribution scheme for distributed sensor networks, and relations between interesting parameters. Namely, given a key-pool of size n ...
Subhas Kumar Ghosh
93
Voted
KDD
2003
ACM
217views Data Mining» more  KDD 2003»
16 years 2 days ago
Algorithms for estimating relative importance in networks
Large and complex graphs representing relationships among sets of entities are an increasingly common focus of interest in data analysis--examples include social networks, Web gra...
Scott White, Padhraic Smyth