Search
Search Results
-
Finding Optimal Solutions with Neighborly Help
Can we efficiently compute optimal solutions to instances of a hard problem from optimal solutions to neighbor instances, that is, instances with one...
-
On Blocky Ranks Of Matrices
A matrix is blocky if it is a "blowup" of a permutation matrix. The blocky rank of a matrix M is the minimum number of blocky matrices that linearly...
-
A Meta-adversarial Framework for Cross-Domain Cold-Start Recommendation
The cold-start problem in recommender systems has been facing a great challenge. Cross-domain recommendation can improve the performance of...
-
-
Leveraging Semantic Information for Enhanced Community Search in Heterogeneous Graphs
Community search (CS) is a vital research area in network science that focuses on discovering personalized communities for query vertices from...
-
FL-GUARD: A Holistic Framework for Run-Time Detection and Recovery of Negative Federated Learning
Federated learning (FL) is a promising approach for learning a model from data distributed on massive clients without exposing data privacy. It works...
-
-
Minimal Roman Dominating Functions: Extensions and Enumeration
Roman domination is one of the many variants of domination that keeps most of the complexity features of the classical domination problem. We prove...
-
The Time Complexity of Consensus Under Oblivious Message Adversaries
We study the problem of solving consensus in synchronous directed dynamic networks, in which communication is controlled by an oblivious message...
-
-
Should Decisions in QCDCL Follow Prefix Order?
Quantified conflict-driven clause learning (QCDCL) is one of the main solving approaches for quantified Boolean formulas (QBF). One of the...
-
Efficient Top-k Frequent Itemset Mining on Massive Data
Top- k frequent itemset mining (top- k FIM) plays an important role in many practical applications. It reports the k itemsets with the highest...
-
-
Non-termination in Term Rewriting and Logic Programming
In this paper, we define two particular forms of non-termination, namely loops and binary chains , in an abstract framework that encompasses term...
-
-
Where To Go at the Next Timestamp
The next Point of Interest ( POI ) recommendation is the core technology of smart city. Current state-of-the-art models attempt to improve the accuracy...
-
Improved FPT Algorithms for Deletion to Forest-Like Structures
The Feedback Vertex Set problem is undoubtedly one of the most well-studied problems in Parameterized Complexity. In this problem, given an...
