Posts

Sampling Subgraphs with Guaranteed Treewidth

D-Tucker: Fast and Memory-Efficient Tucker Decomposition for Dense Tensors

BePI: Fast and Memory-Efficient Method for Billion-Scale Random Walk with Restart

Data Context Adaptation for Accurate Recommendation with Additional Information

Accurate News Recommendation Coalescing Personal and Global Temporal Preferences

BalanSiNG: Fast and Scalable Generation of Realistic Signed Networks

Knowledge Extraction with No Observable Data