Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2021
Efficient computation of deletion-robust k-coverage queries
Knowledge and Information Systems (KAIS), Volume 63, Issue 3Mar 2021, Pages 759–789https://doi.org/10.1007/s10115-020-01540-6AbstractExtracting a controllable subset from a large-scale dataset so that users can fully understand the entire dataset is a significant topic for multicriteria decision making. In recent years, this problem has been widely studied, and various query ...
- short-paperAugust 2019
Streaming Deletion-Robust k-Coverage Queries
SSTD '19: Proceedings of the 16th International Symposium on Spatial and Temporal DatabasesAugust 2019, Pages 170–173https://doi.org/10.1145/3340964.3340972The k-coverage query is an ideal solution for representative queries with almost known nice characteristics, such as stability, scale-invariance, traversal efficiency and so on. In this paper, we formally define deletion-robust k-coverage queries on ...
- articleJuly 2012
Computational derivation of valid kinematic limbs of spatial 3-dof parallel mechanisms without redundant constraint
Robotica (RBTC), Volume 30, Issue 4July 2012, Pages 559–569https://doi.org/10.1017/S0263574711000786A computational derivation of valid kinematic limbs for spatial 3-DOF parallel mechanisms (PMs) without redundant constraint is studied based on contracted graphs, topological graphs, and basic joints. First, some contracted graphs without any binary ...