64 citations · 362 across the 43 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.DB2018★ 2 cited
A General Framework for Anytime Approximation in Probabilistic Databases
Maarten Van den Heuvel, Floris Geerts, Wolfgang Gatterbauer +1
Anytime approximation algorithms that compute the probabilities of queries over probabilistic databases can be of great use to statistical learning tasks. Those approaches have bee…
cs.SI2018★ 12 cited
Any-k: Anytime Top-k Tree Pattern Retrieval in Labeled Graphs
Xiaofeng Yang, Deepak Ajwani, Wolfgang Gatterbauer +3
Many problems in areas as diverse as recommendation systems, social network analysis, semantic search, and distributed root cause analysis can be modeled as pattern search on label…