| A Bargaining Mechanism for One-Way Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Boosting Algorithm for Item Recommendation with Implicit Feedback |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| A Characterization of n-Player Strongly Monotone Scheduling Mechanisms |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Common-Sense Conceptual Categorization System Integrating Heterogeneous Proxytypes and the Dual Process of Reasoning |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| A Complete Epistemic Planner without the Epistemic Closed World Assumption |
✅ |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
3 |
| A Crowdfunding Model for Green Energy Investment |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Deterministic Partition Function Approximation for Exponential Random Graph Models |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| A Dictatorship Theorem for Cake Cutting |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Direct Boosting Approach for Semi-supervised Classification |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| A Fast Goal Recognition Technique Based on Interaction Estimates |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| A Geometric Theory of Feature Selection and Distance-Based Measures |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| A Graph Kernel Based on the Jensen-Shannon Representation Alignment |
❌ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
5 |
| A Hybrid Neural Model for Type Classification of Entity Mentions |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| A Joint Optimization Framework of Sparse Coding and Discriminative Clustering |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| A Logic for Reasoning about Justified Uncertain Beliefs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A MaxSAT Algorithm Using Cardinality Constraints of Bounded Size |
✅ |
✅ |
✅ |
❌ |
✅ |
✅ |
✅ |
6 |
| A Modification of the Halpern-Pearl Definition of Causality |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Modularity-Based Random SAT Instances Generator |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| A Multicore Tool for Constraint Solving |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| A New Input Method for Human Translators: Integrating Machine Translation Effectively and Imperceptibly |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A New Simplex Sparse Learning Model to Measure Data Similarity for Clustering |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| A Personalised Thermal Comfort Model Using a Bayesian Network |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| A Privacy Preserving Algorithm for Multi-Agent Planning and Search |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Pseudo-Polynomial Algorithm for Computing Power Indices in Graph-Restricted Weighted Voting Games |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Scalable Community Detection Algorithm for Large Graphs Using Stochastic Block Models |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
3 |
| A Scalable Interdependent Multi-Issue Negotiation Protocol for Energy Exchange |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| A Simple Probabilistic Extension of Modal Mu-calculus |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Soft Version of Predicate Invention Based on Structured Sparsity |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| A Space Alignment Method for Cold-Start TV Show Recommendations |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| A Study of Human-Agent Collaboration for Multi-UAV Task Allocation in Dynamic Environments |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| A Subspace Learning Framework for Cross-Lingual Sentiment Classification with Partial Parallel Data |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| A Synthetic Approach for Recommendation: Combining Ratings, Social Relations, and Reviews |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| A Top-Down Compiler for Sentential Decision Diagrams |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| A Unified Model for Unsupervised Opinion Spamming Detection Incorporating Text Generality |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| A Unified Probabilistic Model of User Activities and Relations on Social Networking Sites |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| AGM Meets Abstract Argumentation: Expansion and Revision for Dung Frameworks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| AGM Revision of Beliefs about Action and Time |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| ALLEGRO: Belief-Based Programming in Stochastic Dynamical Domains |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| ASAP-UCT: Abstraction of State-Action Pairs in UCT |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Abstract Routing Models and Abstractions in the Context of Vehicle Routing |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Accelerated Inexact Soft-Impute for Fast Large-Scale Matrix Completion |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Action2Activity: Recognizing Complex Activities from Sensor Data |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Active Imitation Learning of Hierarchical Policies |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Active Learning from Crowds with Unsure Option |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| Adaptive Dropout Rates for Learning with Corrupted Features |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Adaptive Sharing for Image Classification |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Adversarial Hierarchical-Task Network Planning for Complex Real-Time Games |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Aesthetic Visual Quality Evaluation of Chinese Handwritings |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Aggregate Demand-Based Real-Time Pricing Mechanism for the Smart Grid: A Game-Theoretic Analysis |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Agile Planning for Real-World Disaster Response |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Algorithmic Exam Generation |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
3 |
| An Active Learning Approach to Coreference Resolution |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| An Adaptive Computational Model for Personalized Persuasion |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| An Algebra of Granular Temporal Relations for Qualitative Reasoning |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| An Efficient Classifier Based on Hierarchical Mixing Linear Support Vector Machines |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| An Exact Inference Scheme for MinSAT |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| An Expectation-Maximization Algorithm to Compute a Stochastic Factorization From Data |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| An Expert-Level Card Playing Agent Based on a Variant of Perfect Information Monte Carlo Sampling |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| An Extension-Based Approach to Belief Revision in Abstract Argumentation |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| An Iterative Approach to Synthesize Data Transformation Programs |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
❌ |
4 |
| An Ontology Matching Approach Based on Affinity-Preserving Random Walks |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Analysis of Sampling Algorithms for Twitter |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Answer Update for Rule-Based Stream Reasoning |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Anytime Inference in Probabilistic Logic Programs with Tp-Compilation |
❌ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Applying Max-Sum to Asymmetric Distributed Constraint Optimization |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Approximate Nash Equilibria with Near Optimal Social Welfare |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Approximately Stable Pricing for Coordinated Purchasing of Electricity |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Artificial Intelligence in the Concertgebouw |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| AskWorld: Budget-Sensitive Query Evaluation for Knowledge-on-Demand |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Automated Geometry Theorem Proving for Human-Readable Proofs |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| Automated Rule Selection for Aspect Extraction in Opinion Mining |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
3 |
| Automatic Generation of Raven’s Progressive Matrices |
✅ |
❌ |
❌ |
✅ |
✅ |
✅ |
✅ |
5 |
| Automatic Verification of Partial Correctness of Golog Programs |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Autonomous Cross-Domain Knowledge Transfer in Lifelong Policy Gradient Reinforcement Learning |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Auxiliary Information Regularized Machine for Multiple Modality Feature Learning |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Balance between Complexity and Quality: Local Search for Minimum Vertex Cover in Massive Graphs |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Batch Reinforcement Learning for Smart Home Energy Management |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Bayesian Modelling of Community-Based Multidimensional Trust in Participatory Sensing under Data Sparsity |
❌ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Belief Revision and Progression of Knowledge Bases in the Epistemic Situation Calculus |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Between Imitation and Intention Learning |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| Beyond SPARQL under OWL 2 QL Entailment Regime: Rules to the Rescue |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Bi-Parameter Space Partition for Cost-Sensitive SVM |
✅ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
6 |
| Biclustering Gene Expressions Using Factor Graphs and the Max-Sum Algorithm |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Bidirectional Constraints for Exchanging Data: Beyond Monotone Queries |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Bonus or Not? Learn to Reward in Crowdsourcing |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Bootstrapping Domain Ontologies from Wikipedia: A Uniform Approach |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
4 |
| Building Hierarchies of Concepts via Crowdsourcing |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| CEIL: A Scalable, Resolution Limit Free Approach for Detecting Communities in Large Networks |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Catch the Black Sheep: Unified Framework for Shilling Attack Detection Based on Fraudulent Action Propagation |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Character-Based Parsing with Convolutional Neural Network |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Characterizability in Belief Revision |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Characterization of Scoring Rules with Distances: Application to the Clustering of Rankings |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Characterization of the Expressivity of Existential Rule Queries |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Characterizing Causal Action Theories and Their Implementations in Answer Set Programming: Action Languages B, C, and Beyond |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Classical Planning with Simulators: Results on the Atari Video Games |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Clustering Dynamic Spatio-Temporal Patterns in The Presence of Noise and Missing Data |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Co-Acquisition of Syntax and Semantics — An Investigation in Spatial Language |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Cognitive Modelling for Predicting Examinee Performance |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Coherence Across Components in Cognitive Systems — One Ontology to Rule Them All |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
2 |
| Collaborative Place Models |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
3 |
| Collective Biobjective Optimization Algorithm for Parallel Test Paper Generation |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Combining Existential Rules and Description Logics |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Combining Existential Rules and Transitivity: Next Steps |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Combining Existential Rules with the Power of CP-Theories |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Combining Eye Movements and EEG to Enhance Emotion Recognition |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Combining Preference Elicitation and Search in Multiobjective State-Space Graphs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Combining Rewriting and Incremental Materialisation Maintenance for Datalog Programs with Equality |
✅ |
✅ |
✅ |
❌ |
✅ |
✅ |
❌ |
5 |
| Compatible-Based Conditioning in Interval-Based Possibilistic Logic |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Compiling Away Uncertainty in Strong Temporal Planning with Uncontrollable Durations |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Compiling Constraint Networks into Multivalued Decomposable Decision Graphs |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
❌ |
4 |
| Complexity Results in Epistemic Planning |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Composing and Verifying Commitment-Based Multiagent Protocols |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Compositional Program Synthesis from Natural Language and Examples |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Compressed Spectral Regression for Efficient Nonlinear Dimensionality Reduction |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Compressive Document Summarization via Sparse Optimization |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Computation and Complexity of Preference Inference Based on Hierarchical Models |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Computational Invention of Cadences and Chord Progressions by Conceptual Chord-Blending |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
2 |
| Computer Science on the Move: Inferring Migration Regularities from the Web via Compressed Label Propagation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Computing Horn Rewritings of Description Logics Ontologies |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Computing Optimal Mixed Strategies for Security Games with Dynamic Payoffs |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Computing Possibly Optimal Solutions for Multi-Objective Constraint Optimisation with Tradeoffs |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Computing Social Behaviours Using Agent Models |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Constrained Information-Theoretic Tripartite Graph Clustering to Identify Semantically Similar Relations |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Context-Independent Claim Detection for Argument Mining |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
3 |
| Controlled Query Evaluation for Datalog and OWL 2 Profile Ontologies |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Convergence of Common Proximal Methods for L1-Regularized Least Squares |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Convergence to Equilibria in Strategic Candidacy |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Convolutional Neural Networks for Text Hashing |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Convolutional Neural Tensor Network Architecture for Community-Based Question Answering |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Copula Graphical Models for Wind Resource Estimation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Correcting Covariate Shift with the Frank-Wolfe Algorithm |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Cost-Optimal and Net-Benefit Planning — A Parameterised Complexity View |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Count-Based Frequency Estimation with Bounded Memory |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Cross-Domain Collaborative Filtering with Review Text |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
3 |
| Cross-View Projective Dictionary Learning for Person Re-Identification |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Crowdsourced Semantic Matching of Multi-Label Annotations |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Data Compression for Learning MRF Parameters |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Data Sparseness in Linear SVM |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Dealing with Generic Contrariness in Structured Argumentation |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Decomposition of the Factor Encoding for CSPs |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Deep Convolutional Neural Networks on Multichannel Time Series for Human Activity Recognition |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Deep Learning for Event-Driven Stock Prediction |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Deep Linear Coding for Fast Graph Clustering |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Deep Low-Rank Coding for Transfer Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Deep Multimodal Hashing with Orthogonal Regularization |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Delete Relaxations for Planning with State-Dependent Action Costs |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
3 |
| Density Corrected Sparse Recovery when R.I.P. Condition Is Broken |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Deordering and Numeric Macro Actions for Plan Repair |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Detecting Emotions in Social Media: A Constrained Optimization Approach |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Detecting Promotion Campaigns in Community Question Answering |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
2 |
| Determining Expert Research Areas with Multi-Instance Learning of Hierarchical Multi-Label Classification Model |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Did You Know? — Mining Interesting Trivia for Entities from Wikipedia |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Differential Semantics of Intervention in Bayesian Networks |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| Differentially Private Matrix Factorization |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Direct Policy Iteration with Demonstrations |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| Discriminative Reordering Model Adaptation via Structural Learning |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Discriminative Unsupervised Dimensionality Reduction |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Dissecting German Grammar and Swiss Passports: Open-Domain Decomposition of Compositional Entries in Large-Scale Knowledge Repositories |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Distance-Bounded Consistent Query Answering |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Do We Criticise (and Laugh) in the Same Way? Automatic Detection of Multi-Lingual Satirical News in Twitter |
❌ |
❌ |
✅ |
✅ |
❌ |
✅ |
❌ |
3 |
| Dual-Regularized Multi-View Outlier Detection |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Efficiency and Complexity of Price Competition Among Single-Product Vendors |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Efficient Algorithms with Performance Guarantees for the Stochastic Multiple-Choice Knapsack Problem |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Efficient Generalized Conditional Gradient with Gradient Sliding for Composite Optimization |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Efficient Model Based Diagnosis with Maximum Satisfiability |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Efficient Operations On MDDs for Building Constraint Programming Models |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Efficient Paraconsistent Reasoning with Ontologies and Rules |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Efficient Query Rewriting in the Description Logic EL and Beyond |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Efficient Search with an Ensemble of Heuristics |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Efficient Semantic Features for Automated Reasoning over Large Theories |
❌ |
❌ |
✅ |
✅ |
❌ |
✅ |
✅ |
4 |
| Efficient, Private, and eps-Strategyproof Elicitation of Tournament Voting Rules |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Efficiently Characterizing Non-Redundant Constraints in Large Real World Qualitative Spatial Networks |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
❌ |
4 |
| Efficiently Finding Conditional Instruments for Causal Inference |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| EigenGP: Gaussian Process Models with Adaptive Eigenfunctions |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Embedding Semantic Relations into Word Representations |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Emotions in Argumentation: an Empirical Evaluation |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| EntScene: Nonparametric Bayesian Temporal Segmentation of Videos Aimed at Entity-Driven Scene Detection |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
2 |
| Environment-Driven Social Force Model: Lévy Walk Pattern in Collective Behavior |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Envy-Free Sponsored Search Auctions with Budgets |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Epistemic Equilibrium Logic |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Epistemic Quantified Boolean Logic: Expressiveness and Completeness Results |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Equilibria Under the Probabilistic Serial Rule |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Equilibrium Analysis of Multi-Defender Security Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Equilibrium Refinement through Negotiation in Binary Voting |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Equivalence Results between Feedforward and Recurrent Neural Networks for Sequences |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Estimating the Margin of Victory of an Election Using Sampling |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Estimating the Probability of Meeting a Deadline in Hierarchical Plans |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Evolving Ambiguous Images |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Exchange of Indivisible Objects with Asymmetry |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Execution Monitoring as Meta-Games for General Game-Playing Robots |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Exploiting Block Deordering for Improving Planners Efficiency |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Exploiting Symmetries by Planning for a Descriptive Quotient |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Exploiting k-Degree Locality to Improve Overlapping Community Detection |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Exploiting the Structure of Unsatisfiable Cores in MaxSAT |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Exploratory Digraph Navigation Using A* |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Exploring Implicit Hierarchical Structures for Recommender Systems |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Expressive Logical Combinators for Free |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Extended Discriminative Random Walk: A Hypergraph Approach to Multi-View Multi-Relational Transductive Learning |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| Extending AGM Contraction to Arbitrary Logics |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Extension Enforcement in Abstract Argumentation as an Optimization Problem |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
3 |
| Face Clustering in Videos with Proportion Prior |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Factored Upper Bounds for Multiagent Planning Problems under Uncertainty with Non-Factored Value Functions |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
1 |
| Fast Combinatorial Algorithm for Optimizing the Spread of Cascades |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| Fast Cross-Validation for Incremental Learning |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Feature Selection from Microarray Data via an Ordered Search with Projected Margin |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Filtering Nogoods Lazily in Dynamic Symmetry Breaking During Search |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Finding Diverse Solutions of High Quality to Constraint Optimization Problems |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Finite Abstractions for the Verification of Epistemic Properties in Open Multi-Agent Systems |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| First-Order Disjunctive Logic Programming vs Normal Logic Programming |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| First-Order Rewritability of Temporal Ontology-Mediated Queries |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Fixed-Parameter Tractable Reductions to SAT for Planning |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Fixing Tournaments for Kings, Chokers, and More |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| FlashNormalize: Programming by Examples for Text Normalization |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Formal Analysis of Dialogues on Infinite Argumentation Frameworks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| From Raw Sensor Data to Detailed Spatial Knowledge |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| From Weighted to Unweighted Model Counting |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Further Connections Between Contract-Scheduling and Ray-Searching Problems |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Generalized Rapid Action Value Estimation |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Generalized Transitive Distance with Minimum Spanning Random Forest |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Generalizing the Single-Crossing Property on Lines and Trees to Intermediate Preferences on Median Graphs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Generating 1 |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Generating all Possible Palindromes from Ngram Corpora |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Gibbard–Satterthwaite Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Graph Invariant Kernels |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Graph-Based Inverse Optimal Control for Robot Manipulation |
✅ |
✅ |
❌ |
✅ |
❌ |
❌ |
✅ |
4 |
| Greedy Structure Search for Sum-Product Networks |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Grounding the Meaning of Words through Vision and Interactive Gameplay |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| Group Decision Making via Weighted Propositional Logic: Complexity and Islands of Tractability |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Groupwise Registration of Aerial Images |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| H-Index Manipulation by Merging Articles: Models, Theory, and Experiments |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Haiku Generator that Reads Blogs and Illustrates Them with Sounds and Images |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Hamming Compatible Quantization for Hashing |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Handling Complex Commands as Service Robot Task Requests |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Heroic versus Collaborative AI for the Arts |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| How Robust Is the Wisdom of the Crowds? |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| How to Select One Preferred Assertional-Based Repair from Inconsistent and Prioritized DL-Lite Knowledge Bases? |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| ICBS: Improved Conflict-Based Search Algorithm for Multi-Agent Pathfinding |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Ice-Breaking: Mitigating Cold-Start Recommendation Problem by Rating Comparison |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Identification of Time-Dependent Causal Model: A Gaussian Process Treatment |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Image Feature Learning for Cold Start Problem in Display Advertising |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Imaging Time-Series to Improve Classification and Imputation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Impartial Peer Review |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Implementing the Wisdom of Waze |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Improving the Effectiveness of SAT-Based Preprocessing for MaxSAT |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Improving the Efficiency of Dynamic Programming on Tree Decompositions via Machine Learning |
❌ |
❌ |
✅ |
✅ |
✅ |
✅ |
❌ |
4 |
| Incentivizing Peer Grading in MOOCS: An Audit Game Approach |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Incorporating Domain and Sentiment Supervision in Representation Learning for Domain Adaptation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Increasingly Cautious Optimism for Practical PAC-MDP Exploration |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Indirect Causes in Dynamic Bayesian Networks Revisited |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Inducing Probabilistic Relational Rules from Probabilistic Examples |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| Inferring Painting Style with Multi-Task Dictionary Learning |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
3 |
| Influence Maximization in Big Networks: An Incremental Algorithm for Streaming Subgraph Influence Spread Estimation |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Influence in Classification via Cooperative Game Theory |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Information Gathering in Networks via Active Exploration |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Instance-Wise Weighted Nonnegative Matrix Factorization for Aggregating Partitions with Locally Reliable Clusters |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Integrated Anchor and Social Link Predictions across Social Networks |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Integrating Importance, Non-Redundancy and Coherence in Graph-Based Extractive Summarization |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Integrating Partial Order Reduction and Symmetry Elimination for Cost-Optimal Classical Planning |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Intelligent Agent Supporting Human-Multi-Robot Team Collaboration |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Interactive Gender Inference with Integer Linear Programming |
❌ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
5 |
| Interest Inference via Structure-Constrained Multi-Source Multi-Task Learning |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Interplanetary Trajectory Planning with Monte Carlo Tree Search |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Intersecting Manifolds: Detection, Segmentation, and Labeling |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Introspective Forecasting |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Inverse Reinforcement Learning in Relational Domains |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Iterative Learning of Parallel Lexicons and Phrases from Non-Parallel Corpora |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Joint Learning of Character and Word Embeddings |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Joint Learning of Constituency and Dependency Grammars by Decomposed Cross-Lingual Induction |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Joint POS Tagging and Text Normalization for Informal Text |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Kernel Contraction and Base Dependence: Redundancy in the Base Resulting in Different Types of Dependence |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Kinetic Imaginations: Exploring the Possibilities of Combining AI and Dance |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Knowledge Base Completion Using Embeddings and Rules |
❌ |
❌ |
✅ |
✅ |
❌ |
✅ |
✅ |
4 |
| Large Scale Homophily Analysis in Twitter Using a Twixonomy |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Learning Behaviors in Agents Systems with Interactive Dynamic Influence Diagrams |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Learning Context-Sensitive Word Embeddings with Neural Tensor Skip-Gram Model |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Learning Cooperative Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Learning Efficient Logical Robot Strategies Involving Composable Objects |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| Learning Geographical Hierarchy Features for Social Image Location Prediction |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Learning Regular Languages via Alternating Automata |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Learning Term Embeddings for Hypernymy Identification |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Learning a Robust Consensus Matrix for Clustering Ensemble via Kullback-Leibler Divergence Minimization |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Learning to Hash on Partial Multi-Modal Data |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Learning to Interpret Natural Language Commands through Human-Robot Dialog |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Learning to Rap Battle with Bilingual Recursive Neural Networks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Lie on the Fly: Iterative Voting Center with Manipulative Voters |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Lightweight Temporal Description Logics with Rigid Roles and Restricted TBoxes |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Limited Lookahead in Imperfect-Information Games |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Linking Heterogeneous Input Features with Pivots for Domain Adaptation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
2 |
| Literal-Based MCS Extraction |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
✅ |
5 |
| Local Translation Prediction with Global Sentence Representation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Logic Program Termination Analysis Using Atom Sizes |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Logic-Geometric Programming: An Optimization-Based Approach to Combined Task and Motion Planning |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Looking at Mondrian's Victory Boogie-Woogie: What Do I Feel? |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| MORRF*: Sampling-Based Multi-Objective Motion Planning |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| MUVIR: Multi-View Rare Category Detection |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Matrix Factorization with Scale-Invariant Parameters |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Max-Sum Goes Private |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Maximal Cooperation in Repeated Games on Social Networks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Maximizing the Coverage of Information Propagation in Social Networks |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Maximum Entropy Semi-Supervised Inverse Reinforcement Learning |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Maximum Satisfiability Using Cores and Correction Sets |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Mechanism Design and Implementation for Lung Exchange |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| Medical Synonym Extraction with Concept Space Models |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Membership Constraints in Formal Concept Analysis |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| MergeXplain: Fast Computation of Multiple Conflicts for Diagnosis |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Merging in the Horn Fragment |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Metareasoning for Planning Under Uncertainty |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Mining Definitions from RDF Annotations Using Formal Concept Analysis |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Mining Expert Play to Guide Monte Carlo Search in the Opening Moves of Go |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
2 |
| Mirror Representation for Modeling View-Specific Transform in Person Re-Identification |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Mixed Discrete-Continuous Heuristic Generative Planning Based on Flow Tubes |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Mixed Error Coding for Face Recognition with Mixed Occlusions |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Mobile Query Recommendation via Tensor Function Learning |
✅ |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
4 |
| Mobility Profiling for User Verification with Anonymized Location Data |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Model Metric Co-Learning for Time Series Classification |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Model-Based Genetic Algorithms for Algorithm Configuration |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Modeling Inter- and Intra-Part Deformations for Object Structure Parsing |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
3 |
| Modeling Mention, Context and Entity with Neural Networks for Entity Disambiguation |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Modeling Multi-Attribute Demand for Sustainable Cloud Computing with Copulae |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Modeling Quantum Entanglements in Quantum Language Models |
✅ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
4 |
| Modeling Users' Dynamic Preference for Personalized Recommendation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Modelling the Persuadee in Asymmetric Argumentation Dialogues for Persuasion |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Models of Action Concurrency in Temporal Planning |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Modular Systems with Preferences |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Multi-Agent Only Knowing on Planet Kripke |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Multi-Armed Bandits for Adaptive Constraint Propagation |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Multi-Document Abstractive Summarization Using ILP Based Multi-Sentence Compression |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Multi-Graph-View Learning for Complicated Object Classification |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Multi-Label Active Learning: Query Type Matters |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Multi-Label Classification with Feature-Aware Non-Linear Label Space Transformation |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Multi-Label Structure Learning with Ising Model Selection |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Multi-Modality Tracker Aggregation: From Generative to Discriminative |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Multi-Objective POMDPs with Lexicographic Reward Preferences |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Multi-Pass High-Level Presolving |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| Multi-Task Model and Feature Joint Learning |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
3 |
| Multi-Task Multi-Dimensional Hawkes Processes for Modeling Event Sequences |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Multi-Task Multi-View Clustering for Non-Negative Data |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Multi-View Matrix Decomposition: A New Scheme for Exploring Discriminative Information |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Multi-view Self-Paced Learning for Clustering |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Multilateral Negotiation in Boolean Games with Incomplete Information Using Generalized Possibilistic Logic |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Multiple Instance Learning-Based Birdsong Classification Using Unsupervised Recording Segmentation |
✅ |
❌ |
✅ |
✅ |
❌ |
✅ |
✅ |
5 |
| Multitask Coactive Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Music Recommenders: User Evaluation Without Real Users? |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Narrative Hermeneutic Circle: Improving Character Role Identification from Natural Language Text via Feedback Loops |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Network Representation Learning with Rich Text Information |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Non-Monotone Adaptive Submodular Maximization |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Non-Myopic Negotiators See What's Best |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Nonnegative Matrix Tri-Factorization with Graph Regularization for Community Detection in Social Networks |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Nonparametric Independence Testing for Small Sample Sizes |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Offline Sketch Parsing via Shapeness Estimation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| On Conceptual Labeling of a Bag of Words |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| On Constrained Boolean Pareto Optimization |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| On Forgetting Postulates in Answer Set Programming |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| On the Aggregation of Argumentation Frameworks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On the Balance of Meter Deployment Cost and NILM Accuracy |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| On the Boundary of (Un)decidability: Decidable Model-Checking for a Fragment of Resource Agent Logic |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| On the Computational Complexity of Naive-Based Semantics for Abstract Dialectical Frameworks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On the Consistency of AUC Pairwise Optimization |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On the Effective Configuration of Planning Domain Models |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| On the Empirical Time Complexity of Random 3-SAT at the Phase Transition |
❌ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
5 |
| On the Entailment Problem for a Logic of Typicality |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| On the Graded Acceptability of Arguments |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On the Online Generation of Effective Macro-Operators |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| On the Parameterized Complexity of Belief Revision |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| On the Progression of Knowledge and Belief for Nondeterministic Actions in the Situation Calculus |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On the Resiliency of Unit Propagation to Max-Resolution |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| On the Runtime of Randomized Local Search and Simple Evolutionary Algorithms for Dynamic Makespan Scheduling |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| On the Undecidability of the Situation Calculus Extended with Description Logic Ontologies |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Online Fair Division: Analysing a Food Bank Problem |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Online Learning of k-CNF Boolean Functions |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Online Learning to Rank for Content-Based Image Retrieval |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
2 |
| Online Mechanisms for Charging Electric Vehicles in Settings with Varying Marginal Electricity Costs |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Online Robust Low Rank Matrix Recovery |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Only Knowing Meets Common Knowledge |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Ontology-Mediated Queries with Closed Predicates |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Open Domain Short Text Conceptualization: A Generative + Descriptive Modeling Approach |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Opportunities or Risks to Reduce Labor in Crowdsourcing Translation? Characterizing Cost versus Quality via a PageRank-HITS Hybrid Model |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Optimal Auctions for Partially Rational Bidders |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Optimal Bayesian Hashing for Efficient Face Recognition |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Optimal Electric Vehicle Charging Station Placement |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Optimal Greedy Diversity for Recommendation |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Optimal Incremental Preference Elicitation during Negotiation |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Optimal Network Security Hardening Using Attack Graph Games |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Optimal Planning with Axioms |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
❌ |
2 |
| Optimal Policy Generation for Partially Satisfiable Co-Safe LTL Specifications |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| Optimal Pricing for the Competitive and Evolutionary Cloud Market |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Optimal Route Search with the Coverage of Users' Preferences |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Optimization of Probabilistic Argumentation with Markov Decision Models |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Optimizing Locally Linear Classifiers with Supervised Anchor Point Learning |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Optimizing Sentence Modeling and Selection for Document Summarization |
✅ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
4 |
| Packing Curved Objects |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Parliamentary Voting Procedures: Agenda Control, Manipulation, and Uncertainty |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Partial Grounded Fixpoints |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Perception Evolution Network Adapting to the Emergence of New Sensory Receptor |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Personalized Ad Recommendation Systems for Life-Time Value Optimization with Guarantees |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
3 |
| Personalized Mathematical Word Problem Generation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Personalized Ranking Metric Embedding for Next New POI Recommendation |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Personalized Sentiment Classification Based on Latent Individuality of Microblog Users |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Personalized Tour Recommendation Based on User Interests and Points of Interest Visit Durations |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
2 |
| Personalizing Product Rankings Using Collaborative Filtering on Opinion-Derived Topic Profiles |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Planning for Stochastic Games with Co-Safe Objectives |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Point-Based Planning for Multi-Objective POMDPs |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Policies that Generalize: Solving Many Planning Problems with the Same Policy |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Policy Shaping with Human Teachers |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Polynomial Rewritings for Linear Existential Rules |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Polynomial-Time Reformulations of LTL Temporally Extended Goals into Final-State Goals |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Polytree-Augmented Classifier Chains for Multi-Label Classification |
❌ |
❌ |
❌ |
✅ |
✅ |
❌ |
✅ |
3 |
| Portable Option Discovery for Automated Learning Transfer in Object-Oriented Markov Decision Processes |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| Portfolio Choices with Orthogonal Bandit Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Positive, Negative, or Neutral: Learning an Expanded Opinion Lexicon from Emoticon-Annotated Tweets |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Possible and Necessary Allocations via Sequential Mechanisms |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Potential Based Reward Shaping for Hierarchical Reinforcement Learning |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Pre-release Prediction of Crowd Opinion on Movies by Label Distribution Learning |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Prime Compilation of Non-Clausal Formulae |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Prior-Based Dual Additive Latent Dirichlet Allocation for User-Item Connected Documents |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Probabilistic Belief Contraction Using Argumentation |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Probabilistic Inference Based Message-Passing for Resource Constrained DCOPs |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Probabilistic Inference in Hybrid Domains by Weighted Model Integration |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Probabilistic Knowledge-Based Programs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Probabilistic Reasoning with Inconsistent Beliefs Using Inconsistency Measures |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Pseudo-Supervised Training Improves Unsupervised Melody Segmentation |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Pushdown Multi-Agent System Verification |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Pushing Forward Marginal MAP with Best-First Search |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Qualitative Reasoning about Directions in Semantic Spaces |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
3 |
| Quantifying Robustness of Trust Systems against Collusive Unfair Rating Attacks Using Information Theory |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Quantized Correlation Hashing for Fast Cross-Modal Search |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Query Rewriting for Existential Rules with Compiled Preorder |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Query Understanding through Knowledge-Based Conceptualization |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Quiet: Faster Belief Propagation for Images and Related Applications |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Raising Expectations in GDA Agents Acting in Dynamic Environments |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Random Feature Mapping with Signed Circulant Matrix Projection |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Ranked Voting on Social Networks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Ranking Preserving Hashing for Fast Similarity Search |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Re-Ranking Voting-Based Answers by Discarding User Behavior Biases |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| ReACTR: Realtime Algorithm Configuration through Tournament Rankings |
✅ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
6 |
| Reactive Integrated Motion Planning and Execution |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Reader-Aware Multi-Document Summarization via Sparse Coding |
✅ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
4 |
| Realizability of Three-Valued Semantics for Abstract Dialectical Frameworks |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Reasoning about Connectivity Constraints |
✅ |
✅ |
❌ |
❌ |
✅ |
❌ |
✅ |
4 |
| Reasoning with Style |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Recommendation Algorithms for Optimizing Hit Rate, User Satisfaction and Website Revenue |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Recovery of Corrupted Multiple Kernels for Clustering |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Reduced Time-Expansion Graphs and Goal Decomposition for Solving Cooperative Path Finding Sub-Optimally |
✅ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
4 |
| Regression Model Fitting under Differential Privacy and Model Inversion Attack |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Regularizing Flat Latent Variables with Hierarchical Structures |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Reinforcement Learning from Demonstration through Shaping |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Representation Learning for Measuring Entity Relatedness with Rich Information |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Revenue Maximization Envy-Free Pricing for Homogeneous Resources |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Revisiting Gaussian Process Dynamical Models |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Robust Dictionary Learning with Capped l1-Norm |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Robust Kernel Dictionary Learning Using a Whole Sequence Convergent Algorithm |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Robust Learning for Repeated Stochastic Games via Meta-Gaming |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
2 |
| Robust Multiple Kernel K-means Using L21-Norm |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Robust Subspace Segmentation by Simultaneously Learning Data Representations and Their Affinity Matrix |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| SAT Is an Effective and Complete Method for Solving Stable Matching Problems with Couples |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Saliency Detection with a Deeper Investigation of Light Field |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Salient Object Detection via Augmented Hypotheses |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Sampling with Minimum Sum of Squared Similarities for Nystrom-Based Large Scale Spectral Clustering |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Saul: Towards Declarative Learning Based Programming |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
3 |
| Scalable Gaussian Process Regression Using Deep Neural Networks |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Scalable Graph Hashing with Feature Transformation |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Scalable Maintenance of Knowledge Discovery in an Ontology Stream |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Scalable Maximum Margin Matrix Factorization by Active Riemannian Subspace Search |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Scalable Probabilistic Tensor Factorization for Binary and Count Data |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Schema.org as a Description Logic |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Secure Routing in Wireless Sensor Networks via POMDPs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Security Games with Information Leakage: Modeling and Computation |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Self-Adaptive Hierarchical Sentence Model |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Selling Reserved Instances in Cloud Computing |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Semantic Concept Discovery for Large-Scale Zero-Shot Event Detection |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Semantic Single Video Segmentation with Robust Graph Representation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Semantic Topic Multimodal Hashing for Cross-Media Retrieval |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Semi-Orthogonal Multilinear PCA with Relaxed Start |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| Semi-Supervised Multi-Label Learning with Incomplete Labels |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Semi-Universal Portfolios with Transaction Costs |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Short and Sparse Text Topic Modeling via Self-Aggregation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Simple Atom Selection Strategy for Greedy Matrix Completion |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Simple Causes of Complexity in Hedonic Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Simplifying A Logic Program Using Its Consequences |
✅ |
❌ |
✅ |
❌ |
❌ |
✅ |
❌ |
3 |
| Simulation-Based Admissible Dominance Pruning |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Simultaneous Abstraction and Equilibrium Finding in Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Sketch the Storyline with CHARCOAL: A Non-Parametric Approach |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Slogans Are Not Forever: Adapting Linguistic Expressions to the News |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Smooth UCT Search in Computer Poker |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Social Image Parsing by Cross-Modal Data Refinement |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Solving Heads-Up Limit Texas Hold'em |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Solving MDPs with Skew Symmetric Bilinear Utility Functions |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Solving QBF by Clause Selection |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
❌ |
4 |
| Solving the Partial Label Learning Problem: An Instance-Based Approach |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Sorting Sequential Portfolios in Automated Planning |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Sparse Probabilistic Matrix Factorization by Laplace Distribution for Collaborative Filtering |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Spectrum-Based Fault Localisation for Multi-Agent Systems |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Speeding Up Automatic Hyperparameter Optimization of Deep Neural Networks by Extrapolation of Learning Curves |
❌ |
✅ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Spiteful Bidding in the Dollar Auction |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Stable Model Semantics of Abstract Dialectical Frameworks Revisited: A Logic Programming Perspective |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Statistical Regimes and Runtime Prediction |
❌ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
5 |
| Stick-Breaking Policy Learning in Dec-POMDPs |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Strategic Abstention Based on Preference Extensions: Positive Results and Computer-Generated Impossibilities |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
1 |
| Strategic Candidacy Games with Lazy Candidates |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Strategic Network Formation through an Intermediary |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Strategy-Proofness of Scoring Allocation Correspondences for Indivisible Goods |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Stroke-Based Stylization Learning and Rendering with Inverse Reinforcement Learning |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Structural Results for Cooperative Decentralized Control Models |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Structural Tractability of Shapley and Banzhaf Values in Allocation Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Structure in Dichotomous Preferences |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Supervised Representation Learning: Transfer Learning with Deep Autoencoders |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Swarm Systems in the Visualization of Consumption Patterns |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Symbol Acquisition for Probabilistic High-Level Planning |
❌ |
❌ |
❌ |
✅ |
✅ |
❌ |
✅ |
3 |
| Symbolic Model Checking for One-Resource RB+-ATL |
✅ |
✅ |
❌ |
❌ |
✅ |
❌ |
✅ |
4 |
| Syntax-Based Deep Matching of Short Texts |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Synthesis for LTL and LDL on Finite Traces |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Tackling Data Sparseness in Recommendation using Social Media based Topic Hierarchy Modeling |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Target-Dependent Twitter Sentiment Classification with Rich Automatic Features |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Temporal Planning with Semantic Attachment of Non-Linear Monotonic Continuous Behaviours |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Temporal Query Answering in the Description Logic EL |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Adjusted Winner Procedure: Characterizations and Equilibria |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Combined Approach to Query Answering Beyond the OWL 2 Profiles |
❌ |
✅ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| The Complexity of MAP Inference in Bayesian Networks Specified Through Logical Languages |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Complexity of Model Checking Succinct Multiagent Systems |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Complexity of Subsumption in Fuzzy EL |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Cube of Opposition: A Structure Underlying Many Knowledge Representation Formalisms |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Game-Theoretic Interaction Index on Social Networks with Applications to Link Prediction and Community Detection |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| The Logic of Qualitative Probability |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Power of Local Manipulation Strategies in Assignment Mechanisms |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| The Right to Obscure: A Mechanism and Initial Evaluation |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| The Scaffolded Sound Beehive |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Thompson Sampling for Budgeted Multi-Armed Bandits |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Tight Bounds for HTN Planning with Task Insertion |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Topic Modeling with Document Relative Similarities |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Toward Estimating Others' Transition Models Under Occlusion for Multi-Robot IRL |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| Towards Addressing the Winograd Schema Challenge — Building and Using a Semantic Parser and a Knowledge Hunting Module |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Towards Automatic Dominance Breaking for Constraint Optimization Problems |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
❌ |
2 |
| Towards City-Scale Mobile Crowdsourcing: Task Recommendations under Trajectory Uncertainties |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Towards Class-Imbalance Aware Multi-Label Learning |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Towards Domain-Specific Semantic Relatedness: A Case Study from Geography |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Towards Fully Observable Non-Deterministic Planning as Assumption-based Automatic Synthesis |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Tracking Political Elections on Social Media: Applications and Experience |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
2 |
| Tractable Classes of Binary CSPs Defined by Excluded Topological Minors |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Tractable Inquiry in Information-Rich Environments |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Tractable Learning for Structured Probability Spaces: A Case Study in Learning Preference Distributions |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Tradeoffs between Incentive Mechanisms in Boolean Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Trailer Generation via a Point Process-Based Visual Attractiveness Model |
✅ |
❌ |
❌ |
✅ |
✅ |
❌ |
✅ |
4 |
| Training-Efficient Feature Map for Shift-Invariant Kernels |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Training-Time Optimization of a Budgeted Booster |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Trust-Sensitive Belief Revision |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Truthful Cake Cutting Mechanisms with Externalities: Do Not Make Them Care for Others Too Much! |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Uncovering Hidden Structure through Parallel Problem Decomposition for the Set Basis Problem: Application to Materials Discovery |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Uncovering the Formation of Triadic Closure in Social Networks |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
❌ |
4 |
| Unsupervised Learning of an IS-A Taxonomy from a Limited Domain-Specific Corpus |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Unsupervised Machine Condition Monitoring Using Segmental Hidden Markov Models |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Unsupervised Sentiment Analysis for Social Media Images |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| User Modeling with Neural Network for Review Rating Prediction |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Using A* for Inference in Probabilistic Classifier Chains |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Using a Recursive Neural Network to Learn an Agent's Decision Model for Plan Recognition |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| VRCA: A Clustering Algorithm for Massive Amount of Texts |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Verification of Generalized Inconsistency-Aware Knowledge and Action Bases |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Verification of Knowledge-Based Programs over Description Logic Actions |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Verifying Emergent Properties of Swarms |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Video Covariance Matrix Logarithm for Human Action Recognition in Videos |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Weakly Supervised Matrix Factorization for Noisily Tagged Image Parsing |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Weakly Supervised RBM for Semantic Segmentation |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Web Page Classification Based on Uncorrelated Semi-Supervised Intra-View and Inter-View Manifold Discriminant Feature Extraction |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Welfare Maximization in Fractional Hedonic Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| What Do We Elect Committees For? A Voting Committee Model for Multi-Winner Rules |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| When Does Schwartz Conjecture Hold? |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| When Security Games Go Green: Designing Defender Strategies to Prevent Poaching and Illegal Fishing |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Word Embedding Revisited: A New Representation Learning and Explicit Matrix Factorization Perspective |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Word-Error Correction of Continuous Speech Recognition Based on Normalized Relevance Distance |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
3 |
| α-min: A Compact Approximate Solver For Finite-Horizon POMDPs |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |