arXiv Computer Science @arxiv_cs@qoto.org

K-NN active learning under local smoothness assumption. (arXiv:2001.06485v1 [cs.LG]) http://arxiv.org/abs/2001.06485

Algorithms in Multi-Agent Systems: A Holistic Perspective from Reinforcement Learning and Game Theory. (arXiv:2001.06487v1 [cs.GT]) http://arxiv.org/abs/2001.06487

Temporal Interlacing Network. (arXiv:2001.06499v1 [cs.CV]) http://arxiv.org/abs/2001.06499

Robust Gaussian Joint Source-Channel Coding Under the Near-Zero Bandwidth Regime. (arXiv:2001.06507v1 [cs.IT]) http://arxiv.org/abs/2001.06507

Trust in AutoML: Exploring Information Needs for Establishing Trust in Automated Machine Learning Systems. (arXiv:2001.06509v1 [cs.LG]) http://arxiv.org/abs/2001.06509

Population-based metaheuristics for Association Rule Text Mining. (arXiv:2001.06517v1 [cs.NE]) http://arxiv.org/abs/2001.06517

On Scheduler Side-Channels in Dynamic-Priority Real-Time Systems. (arXiv:2001.06519v1 [cs.CR]) http://arxiv.org/abs/2001.06519

Activism by the AI Community: Analysing Recent Achievements and Future Prospects. (arXiv:2001.06528v1 [cs.CY]) http://arxiv.org/abs/2001.06528

CHAOS Challenge -- Combined (CT-MR) Healthy Abdominal Organ Segmentation. (arXiv:2001.06535v1 [eess.IV]) http://arxiv.org/abs/2001.06535

Simpler Partial Derandomization of PPSZ for $k$-SAT. (arXiv:2001.06536v1 [cs.CC]) http://arxiv.org/abs/2001.06536

Curriculum Labeling: Self-paced Pseudo-Labeling for Semi-Supervised Learning. (arXiv:2001.06001v1 [cs.LG]) http://arxiv.org/abs/2001.06001

Elements of Scheduling. (arXiv:2001.06005v1 [cs.DS]) http://arxiv.org/abs/2001.06005

User-in-the-loop Adaptive Intent Detection for Instructable Digital Assistant. (arXiv:2001.06007v1 [cs.HC]) http://arxiv.org/abs/2001.06007

An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional Codes. (arXiv:2001.06029v1 [cs.IT]) http://arxiv.org/abs/2001.06029

Compactly Supported Quasi-tight Multiframelets with High Balancing Orders and Compact Framelet Transforms. (arXiv:2001.06032v1 [math.FA]) http://arxiv.org/abs/2001.06032

Extracting more from boosted decision trees: A high energy physics case study. (arXiv:2001.06033v1 [stat.ML]) http://arxiv.org/abs/2001.06033

Low Complexity Algorithms for Transmission of Short Blocks over the BSC with Full Feedback. (arXiv:2001.06035v1 [cs.IT]) http://arxiv.org/abs/2001.06035

Tourneys and the Fast Generation and Obfuscation of Closed Knight's Tours. (arXiv:2001.06044v1 [cs.DM]) http://arxiv.org/abs/2001.06044

Expecting the Unexpected: Developing Autonomous-System Design Principles for Reacting to Unpredicted Events and Conditions. (arXiv:2001.06047v1 [cs.SE]) http://arxiv.org/abs/2001.06047

Extending drawings of complete graphs into arrangements of pseudocircles. (arXiv:2001.06053v1 [math.CO]) http://arxiv.org/abs/2001.06053