Sciweavers

104 search results - page 13 / 21
» Range queries over skip tree graphs
Sort
View
AI
2010
Springer
13 years 7 months ago
Understanding the scalability of Bayesian network inference using clique tree growth curves
Bayesian networks (BNs) are used to represent and ef ciently compute with multi-variate probability distributions in a wide range of disciplines. One of the main approaches to per...
Ole J. Mengshoel
SIGMOD
2010
ACM
364views Database» more  SIGMOD 2010»
14 years 8 days ago
Optimizing schema-last tuple-store queries in graphd
Current relational databases require that a database schema exist prior to data entry and require manual optimization for best performance. We describe the query optimization tech...
Scott M. Meyer, Jutta Degener, John Giannandrea, B...
PC
2007
118views Management» more  PC 2007»
13 years 7 months ago
Peer-to-peer systems for discovering resources in a dynamic grid
The convergence of the Grid and Peer-to-Peer (P2P) worlds has led to many solutions that try to efficiently solve the problem of resource discovery on Grids. Some of these solutio...
Moreno Marzolla, Matteo Mordacchini, Salvatore Orl...
PVLDB
2010
104views more  PVLDB 2010»
13 years 5 months ago
Boosting the Accuracy of Differentially Private Histograms Through Consistency
We show that it is possible to significantly improve the accuracy of a general class of histogram queries while satisfying differential privacy. Our approach carefully chooses a...
Michael Hay, Vibhor Rastogi, Gerome Miklau, Dan Su...
CIKM
2010
Springer
13 years 6 months ago
Fast and accurate estimation of shortest paths in large graphs
Computing shortest paths between two given nodes is a fundamental operation over graphs, but known to be nontrivial over large disk-resident instances of graph data. While a numbe...
Andrey Gubichev, Srikanta J. Bedathur, Stephan Seu...