| A Characterization of the Single-Peaked Single-Crossing Domain |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Constructive Argumentation Framework |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Control Dichotomy for Pure Scoring Rules |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Convex Formulation for Semi-Supervised Multi-Label Feature Selection |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| A Data Complexity Approach to Kernel Selection for Support Vector Machines |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Framework for Task Planning in Heterogeneous Multi Robot Systems Based on Robot Capabilities |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| A Game-Theoretic Analysis of Catalog Optimization |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Generalization of Probabilistic Serial to Randomized Social Choice |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| A Generalized Genetic Algorithm-Based Solver for Very Large Jigsaw Puzzles of Complex Types |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| A Hybrid Grammar-Based Approach for Learning and Recognizing Natural Hand Gestures |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| A Joint Optimization Model for Image Summarization Based on Image Content and Tags |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| A Knowledge Compilation Map for Ordered Real-Valued Decision Diagrams |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Knowledge Representation that Models Memory in Narrative Comprehension |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Latent Variable Model for Discovering Bird Species Commonly Misidentified by Citizen Scientists |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| A Local Non-Negative Pursuit Method for Intrinsic Manifold Structure Preservation |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| A Machine Learning Approach to Musically Meaningful Homogeneous Style Classification |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
1 |
| A Model Attention and Selection Framework for Estimation of Many Variables, with Applications to Estimating Object States in Large Spatial Environments |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Model for Aggregating Contributions of Synergistic Crowdsourcing Workflows |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| A Multiarmed Bandit Incentive Mechanism for Crowdsourcing Demand Response in Smart Grids |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| A Novel Single-DBN Generative Model for Optimizing POMDP Controllers by Probabilistic Inference |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Parameterized Complexity Analysis of Generalized CP-Nets |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| A Propagator Design Framework for Constraints over Sequences |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| A Reasoner for the RCC-5 and RCC-8 Calculi Extended with Constants |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
❌ |
4 |
| A Region-Based Model for Estimating Urban Air Pollution |
❌ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
5 |
| A Relevance-Based Compilation Method for Conformant Probabilistic Planning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| A Scheduler for Actions with Iterated Durations |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| A Simple Polynomial-Time Randomized Distributed Algorithm for Connected Row Convex Constraints |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| A Spatially Sensitive Kernel to Predict Cognitive Performance from Short-Term Changes in Neural Structure |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| A Strategy-Aware Technique for Learning Behaviors from Discrete Human Feedback |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| A Strategy-Proof Online Auction with Time Discounting Values |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| A Support-Based Algorithm for the Bi-Objective Pareto Constraint |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| A Tractable Approach to ABox Abduction over Description Logic Ontologies |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| ARIA: Asymmetry Resistant Instance Alignment |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Abduction Framework for Repairing Incomplete EL Ontologies: Complexity Results and Algorithms |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
❌ |
4 |
| Accurate Household Occupant Behavior Modeling Based on Data Mining Techniques |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Accurate Integration of Aerosol Predictions by Smoothing on a Manifold |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Acquiring Commonsense Knowledge for Sentiment Analysis through Human Computation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Acquiring Comparative Commonsense Knowledge from the Web |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
3 |
| Active Learning for Crowdsourcing Using Knowledge Transfer |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
3 |
| Active Learning with Model Selection |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Adaptation-Guided Case Base Maintenance |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Adaptive Knowledge Transfer for Multiple Instance Learning in Image Classification |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Adaptive Multi-Compositionality for Recursive Neural Models with Applications to Sentiment Analysis |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Adaptive Singleton-Based Consistencies |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Adding Local Exploration to Greedy Best-First Search in Satisficing Planning |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Addressing Complexity in Multi-Issue Negotiation via Utility Hypergraphs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Advice Provision for Choice Selection Processes with Ranked Options |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Agent Behavior Prediction and Its Generalization Analysis |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| An Adversarial Interpretation of Information-Theoretic Bounded Rationality |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| An Agent-Based Model Studying the Acquisition of a Language System of Logical Constructions |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| An Experimentally Efficient Method for (MSS,CoMSS) Partitioning |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Analogy Tutor: A Tutoring System for Promoting Conceptual Learning via Comparison |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Anytime Active Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Approximate Equilibrium and Incentivizing Social Coordination |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Approximate Lifting Techniques for Belief Propagation |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Association Rule Hiding Based on Evolutionary Multi-Objective Optimization by Removing Items |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Automatic Construction and Natural-Language Description of Nonparametric Regression Models |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Automatic Game Design via Mechanic Generation |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Automatically Creating Multilingual Lexical Resources |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Avoiding Plagiarism in Markov Sequence Generation |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Backdoors into Heterogeneous Classes of SAT and CSP |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Backdoors to Planning |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Bagging by Design (on the Suboptimality of Bagging) |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Beat the Cheater: Computing Game-Theoretic Strategies for When to Kick a Gambler out of a Casino |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Betting Strategies, Market Selection, and the Wisdom of Crowds |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Biased Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Binary Aggregation by Selection of the Most Representative Voters |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Boosting SBDS for Partial Symmetry Breaking in Constraint Programming |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Bounding the Support Size in Extensive Form Games with Imperfect Information |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Cached Iterative Weakening for Optimal Multi-Way Number Partitioning |
❌ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Calibration-Free BCI Based Control |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Can Agent Development Affect Developer’s Strategy? |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Capturing Difficulty Expressions in Student Online Q&A Discussions |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Capturing Relational Schemas and Functional Dependencies in RDFS |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Challenges in Materials Discovery – Synthetic Generator and Real Datasets |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Chance-Constrained Probabilistic Simple Temporal Problems |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Chinese Overt Pronoun Resolution: A Bilingual Approach |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
3 |
| Chinese Zero Pronoun Resolution: An Unsupervised Approach Combining Ranking and Integer Linear Programming |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Coactive Learning for Locally Optimal Problem Solving |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Collaborative Models for Referring Expression Generation in Situated Dialogue |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Combining Heterogenous Social and Geographical Information for Event Recommendation |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Combining Multiple Correlated Reward and Shaping Signals by Measuring Confidence |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| Communication-Restricted Exploration for Small Teams |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Compact Aspect Embedding for Diversified Query Expansions |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
3 |
| Compilation Based Approaches to Probabilistic Planning — Thesis Summary |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Computing Contingent Plans via Fully Observable Non-Deterministic Planning |
❌ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Computing General First-Order Parallel and Prioritized Circumscription |
❌ |
✅ |
✅ |
❌ |
✅ |
✅ |
❌ |
4 |
| Computing Preferences Based on Agents’ Beliefs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Confident Reasoning on Raven’s Progressive Matrices Tests |
✅ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
4 |
| Congestion Games for V2G-Enabled EV Charging |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Constructing Symbolic Representations for High-Level Planning |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
1 |
| Content-Structural Relation Inference in Knowledge Base |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Context-Aware Collaborative Topic Regression with Social Matrix Factorization for Recommender Systems |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Contextually Supervised Source Separation with Application to Energy Disaggregation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Contraction and Revision over DL-Lite TBoxes |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Converting Instance Checking to Subsumption: A Rethink for Object Queries over Practical Ontologies |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Convex Co-embedding |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Coordination of Multiple Teams of Robots for an Optimal Global Plan |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| CoreCluster: A Degeneracy Based Graph Clustering Framework |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Cost-Based Query Optimization via AI Planning |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Cross-Domain Metric Learning Based on Information Theory |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Cross-Lingual Knowledge Validation Based Taxonomy Derivation from Heterogeneous Online Wikis |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Cross-View Feature Learning for Scalable Social Image Analysis |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Crowdsourced Explanations for Humorous Internet Memes |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| DJAO: A Communication-Constrained DCOP Algorithm that Combines Features of ADOPT and Action-GDL |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Data Clustering by Laplacian Regularized L1-Graph |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Data Quality in Ontology-based Data Access: The Case of Consistency |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Datalog Rewritability of Disjunctive Datalog Programs and its Applications to Ontology Reasoning |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Decentralized Multi-Agent Reinforcement Learning in Average-Reward Dynamic DCOPs |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Decentralized Stochastic Planning with Anonymity in Interactions |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Decomposing Activities of Daily Living to Discover Routine Clusters |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Deep Modeling of Group Preferences for Group-Based Recommendation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Deep Salience: Visual Salience Modeling via Deep Belief Propagation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Delivering Guaranteed Display Ads under Reach and Frequency Requirements |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Designing Fast Absorbing Markov Chains |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Detecting Information-Dense Texts in Multiple News Domains |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Diagnosing Analogue Linear Systems Using Dynamic Topological Reconfiguration |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Diagram Understanding in Geometry Questions |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Direct Semantic Analysis for Social Image Classification |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Discovering Better AAAI Keywords via Clustering with Community-Sourced Constraints |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Distribution-Aware Sampling and Weighted Model Counting for SAT |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Double Configuration Checking in Stochastic Local Search for Satisfiability |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Doubly Regularized Portfolio with Risk Minimization |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Dramatis: A Computational Model of Suspense |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Dropout Training for Support Vector Machines |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Dynamic Bayesian Probabilistic Matrix Factorization |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Dynamic Multi-Agent Task Allocation with Spatial and Temporal Constraints |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Echo-State Conditional Restricted Boltzmann Machines |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Effective Management of Electric Vehicle Storage Using Smart Charging |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Efficient Buyer Groups for Prediction-of-Use Electricity Tariffs |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Efficient Codes for Inverse Dynamics During Walking |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Efficient Generalized Fused Lasso and its Application to the Diagnosis of Alzheimer’s Disease |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Efficient Object Detection via Adaptive Online Selection of Sensor-Array Elements |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Efficient Optimization for Autonomous Robotic Manipulation of Natural Objects |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Efficiently Implementing GOLOG with Answer Set Programming |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Elementary Loops Revisited |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Elimination Ordering in Lifted First-Order Probabilistic Inference |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
❌ |
3 |
| Emotion Classification in Microblog Texts Using Class Sequential Rules |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Encoding Tree Sparsity in Multi-Task Learning: A Probabilistic Framework |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
2 |
| Envy-Free Division of Sellable Goods |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Equilibria in Epidemic Containment Games |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Evaluating Trauma Patients: Addressing Missing Covariates with Joint Optimization |
✅ |
❌ |
❌ |
✅ |
✅ |
❌ |
✅ |
4 |
| Event Recommendation in Event-Based Social Networks |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Evolutionary Dynamics of Q-Learning over the Sequence Form |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Exact Subspace Clustering in Linear Time |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| Experiments on Visual Information Extraction with the Faces of Wikipedia |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Explanation-Based Approximate Weighted Model Counting for Probabilistic Logics |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Exploiting Competition Relationship for Robust Visual Recognition |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| Exploiting Support Sets for Answer Set Programs with External Evaluations |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Exploring the Boundaries of Decidable Verification of Non-Terminating Golog Programs |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Exponential Deepening A* for Real-Time Agent-Centered Search |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Extending Tournament Solutions |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Extracting Keyphrases from Research Papers Using Citation Networks |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| False-Name Bidding and Economic Efficiency in Combinatorial Auctions |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Fast Algorithm for Non-Stationary Gaussian Process Prediction |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Fast Consistency Checking of Very Large Real-World RCC-8 Constraint Networks Using Graph Partitioning |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Fast Multi-Instance Multi-Label Learning |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Fast and Accurate Influence Maximization on Large Networks with Pruned Monte-Carlo Simulations |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Feature Selection at the Discrete Limit |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Feature-Cost Sensitive Learning with Submodular Trees of Classifiers |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Finding Median Point-Set Using Earth Mover’s Distance |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Finding the k-best Equivalence Classes of Bayesian Network Structures for Model Averaging |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Fixing a Balanced Knockout Tournament |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Flexible and Scalable Partially Observable Planning with Linear Translations |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
1 |
| Forecasting Potential Diabetes Complications |
✅ |
✅ |
❌ |
❌ |
✅ |
❌ |
✅ |
4 |
| Fraudulent Support Telephone Number Identification Based on Co-Occurrence Information on the Web |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Fused Feature Representation Discovery for High-Dimensional and Sparse Data |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| GP-Localize: Persistent Mobile Robot Localization Using Online Sparse Gaussian Process Observation Model |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Game-Theoretic Resource Allocation for Protecting Large Public Events |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
3 |
| GenEth: A General Ethical Dilemma Analyzer |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Generalized Higher-Order Tensor Decomposition via Parallel ADMM |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Generalized Label Reduction for Merge-and-Shrink Heuristics |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Generalizing Policy Advice with Gaussian Process Bandits for Dynamic Skill Improvement |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Generating Content for Scenario-Based Serious-Games Using CrowdSourcing |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Genotypic versus Behavioural Diversity for Teams of Programs under the 4-v-3 Keepaway Soccer Task |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Give a Hard Problem to a Diverse Team: Exploring Large Action Spaces |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| Globally and Locally Consistent Unsupervised Projection |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Gradient Descent with Proximal Average for Nonconvex and Composite Regularization |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Grandpa Hates Robots – Interaction Constraints for Planning in Inhabited Environments |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Grounding Acoustic Echoes in Single View Geometry Estimation |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| HC-Search for Multi-Label Prediction: An Empirical Study |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| How Do Your Friends on Social Media Disclose Your Emotions? |
✅ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
5 |
| How Long Will It Take? Accurate Prediction of Ontology Reasoning Performance |
✅ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
6 |
| Huffman Coding for Storing Non-Uniformly Distributed Messages in Networks of Neural Cliques |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Hybrid Heterogeneous Transfer Learning through Deep Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Hybrid Singular Value Thresholding for Tensor Completion |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
2 |
| Identifying Differences in Physician Communication Styles with a Log-Linear Transition Component Model |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Identifying Domain-Dependent Influential Microblog Users: A Post-Feature Based Approach |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Identifying Hierarchies for Fast Optimal Search |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| Imitation Learning with Demonstrations and Shaping Rewards |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Improving Context and Category Matching for Entity Search |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Improving Domain-independent Cloud-Based Speech Recognition with Domain-Dependent Phonetic Post-Processing |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Improving Semi-Supervised Target Alignment via Label-Aware Base Kernels |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Imputation, Social Choice, and Partial Preferences |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Incentives for Truthful Information Elicitation of Continuous Signals |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Incentivizing High-Quality Content from Heterogeneous Users: On the Existence of Nash Equilibrium |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Incomplete Preferences in Single-Peaked Electorates |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Increasing VCG Revenue by Decreasing the Quality of Items |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Inference Graphs: A New Kind of Hybrid Reasoning System |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Inferring Causal Directions in Errors-in-Variables Models |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Influence Maximization with Novelty Decay in Social Networks |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Information Sharing for Care Coordination |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Instance-Based Domain Adaptation in NLP via In-Target-Domain Logistic Approximation |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
4 |
| Intelligent System for Urban Emergency Management during Large-Scale Disaster |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
3 |
| Internally Stable Matchings and Exchanges |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Intra-View and Inter-View Supervised Correlation Analysis for Multi-View Feature Learning |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Item Bidding for Combinatorial Public Projects |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Joint Morphological Generation and Syntactic Linearization |
✅ |
✅ |
✅ |
✅ |
✅ |
✅ |
✅ |
7 |
| Joule Counting Correction for Electric Vehicles Using Artificial Neural Networks |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Kernelized Bayesian Transfer Learning |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Knowledge Graph Embedding by Translating on Hyperplanes |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| LASS: A Simple Assignment Model with Laplacian Smoothing |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| LSDH: A Hashing Approach for Large-Scale Link Prediction in Microblogs |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Labeling Complicated Objects: Multi-View Multi-Instance Multi-Label Learning |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Large-Scale Analogical Reasoning |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Large-Scale Optimistic Adaptive Submodularity |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Large-Scale Supervised Multimodal Hashing with Semantic Correlation Maximization |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Latent Domains Modeling for Visual Domain Adaptation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Latent Low-Rank Transfer Subspace Learning for Missing Modality Recognition |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Lazy Defenders Are Almost Optimal against Diligent Attackers |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Learning Compositional Sparse Models of Bimodal Percepts |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Learning Concept Embeddings for Query Expansion by Quantum Entropy Minimization |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Learning Deep Representations for Graph Clustering |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Learning Goal-Oriented Hierarchical Tasks from Situated Interactive Instruction |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Learning Instance Concepts from Multiple-Instance Data with Bags as Distributions |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Learning Latent Engagement Patterns of Students in Online Courses |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
2 |
| Learning Low-Rank Representations with Classwise Block-Diagonal Structure for Robust Face Recognition |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Learning Parametric Models for Social Infectivity in Multi-Dimensional Hawkes Processes |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Learning Relative Similarity by Stochastic Dual Coordinate Ascent |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Learning Scripts as Hidden Markov Models |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Learning Temporal Dynamics of Behavior Propagation in Social Networks |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Learning Unknown Event Models |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Learning Word Representation Considering Proximity and Ambiguity |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Learning from Unscripted Deictic Gesture and Language for Human-Robot Interactions |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Learning the Structure of Probabilistic Graphical Models with an Extended Cascading Indian Buffet Process |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Learning to Recognize Novel Objects in One Shot through Human-Robot Interactions in Natural Language Dialogues |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Learning with Augmented Class by Exploiting Unlabeled Data |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Leveraging Decomposed Trust in Probabilistic Matrix Factorization for Effective Recommendation |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Leveraging Fee-Based, Imperfect Advisors in Human-Agent Games of Trust |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Lifetime Lexical Variation in Social Media |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Lifting Relational MAP-LPs Using Cluster Signatures |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Linear-Time Filtering Algorithms for the Disjunctive Constraint |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Living and Searching in the World: Object-Based State Estimation for Mobile Robots |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
1 |
| Local-to-Global Consistency Implies Tractability of Abduction |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Locality Preserving Hashing |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Locality Preserving Projection for Domain Adaptation with Multi-Objective Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Locality-Constrained Low-Rank Coding for Image Classification |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Low-Rank Tensor Completion with Spatio-Temporal Consistency |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Low-Rank Tensor Learning with Discriminant Analysis for Action Classification and Image Recovery |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Machine Translation with Real-Time Web Search |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Making CP-Nets (More) Useful |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Managing Change in Graph-Structured Data Using Description Logics |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Manifold Learning for Jointly Modeling Topic and Visualization |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Manifold Spanning Graphs |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Mapping Users across Networks by Manifold Alignment on Hypergraph |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| MaxSAT by Improved Instance-Specific Algorithm Configuration |
✅ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
6 |
| Maximum Satisfiability Using Core-Guided MaxSAT Resolution |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| Mechanism Design for Mobile Geo-Location Advertising |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Mechanism Design for Scheduling with Uncertain Execution Time |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Mind the Gap: Machine Translation by Minimizing the Semantic Gap in Embedding Space |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Minimising Undesired Task Costs in Multi-Robot Task Allocation Problems with In-Schedule Dependencies |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Mixing-Time Regularized Policy Gradient |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Modal Ranking: A Uniquely Robust Voting Rule |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Modeling Argumentation and Explanation in the Social Web |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Modeling Subjective Experience-Based Learning under Uncertainty and Frames |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Modeling and Mining Spatiotemporal Patterns of Infection Risk from Heterogeneous Data for Active Surveillance Planning |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Modeling and Predicting Popularity Dynamics via Reinforced Poisson Processes |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Monte Carlo Filtering Using Kernel Embedding of Distributions |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Monte-Carlo Simulation Adjusting |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Multi-Instance Learning with Distribution Change |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Multi-Organ Exchange: The Whole Is Greater than the Sum of its Parts |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Multiagent Metareasoning through Organizational Design |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
2 |
| Multilabel Classification with Label Correlations and Missing Labels |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Natural Temporal Difference Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| New Models for Competitive Contagion |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Non-Convex Feature Learning via Lp,inf Operator |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Non-Linear Label Ranking for Large-Scale Prediction of Long-Term User Interests |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Non-Restarting SAT Solvers with Simple Preprocessing Can Efficiently Simulate Resolution |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Novel Density-Based Clustering Algorithms for Uncertain Data |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| On Boosting Sparse Parities |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| On Computing Optimal Strategies in Open List Proportional Representation: The Two Parties Case |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On Dataless Hierarchical Text Classification |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| On Detecting Nearly Structured Preference Profiles |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On Hair Recognition in the Wild by Machine |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
3 |
| On the Axiomatic Characterization of Runoff Voting Rules |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On the Challenges of Physical Implementations of RBMs |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| On the Incompatibility of Efficiency and Strategyproofness in Randomized Social Choice |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| On the Structure of Synergies in Cooperative Games |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Online (Budgeted) Social Choice |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Online Classification Using a Voted RDA Method |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Online Multi-Task Gradient Temporal-Difference Learning |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Online Multi-Task Learning via Sparse Dictionary Optimization |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Online Portfolio Selection with Group Sparsity |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Online Search Algorithm Configuration |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Online Social Spammer Detection |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Online and Stochastic Learning with a Human Cognitive Bias |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Optimal Decoupling in Linear Constraint Systems |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Optimal Neighborhood Preserving Visualization by Maximum Satisfiability |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Optimal and Efficient Stochastic Motion Planning in Partially-Known Environments |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Optimizing and Learning Diffusion Behaviors in Complex Network |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Ordering Effects and Belief Adjustment in the Use of Comparison Shopping Agents |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Oversubscription Planning: Complexity and Compilability |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| PAC Rank Elicitation through Adaptive Sampling of Stochastic Pairwise Preferences |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| PREGO: An Action Language for Belief-Based Cognitive Robotics in Continuous Domains |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Pairwise-Covariance Linear Discriminant Analysis |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Parallel Materialisation of Datalog Programs in Centralised, Main-Memory RDF Systems |
✅ |
✅ |
✅ |
❌ |
✅ |
✅ |
✅ |
6 |
| Parallel Restarted Search |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Parametrized Families of Hard Planning Problems from Phase Transitions |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
3 |
| Partial Multi-View Clustering |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Partial Satisfaction Planning under Time Uncertainty with Control on When Objectives Can Be Aborted |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Pathway Specification and Comparative Queries: A High Level Language with Petri Net Semantics |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
✅ |
4 |
| Pay-As-You-Go OWL Query Answering Using a Triple Store |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
❌ |
3 |
| Placement of Loading Stations for Electric Vehicles: No Detours Necessary! |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Planning as Model Checking in Hybrid Domains |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
2 |
| Point-Based POMDP Solving with Factored Value Function Approximation |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Potential-Aware Imperfect-Recall Abstraction with Earth Mover’s Distance in Imperfect-Information Games |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Power Iterated Color Refinement |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Pre-Trained Multi-View Word Embedding Using Two-Side Neural Network |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Predicting Emotions in User-Generated Videos |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Predicting Postoperative Atrial Fibrillation from Independent ECG Components |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Predicting the Hardness of Learning Bayesian Networks |
❌ |
❌ |
✅ |
✅ |
✅ |
✅ |
✅ |
5 |
| Prediction of Helpful Reviews Using Emotions Extraction |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Preference Elicitation and Interview Minimization in Stable Matchings |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Preprocessing for Propositional Model Counting |
✅ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
5 |
| Prices Matter for the Parameterized Complexity of Shift Bribery |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Privacy and Regression Model Preserved Learning |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Probabilistic Planning with Reduced Models |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Programming by Example Using Least General Generalizations |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Propagating Regular Counting Constraints |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Proximal Iteratively Reweighted Algorithm with Multiple Splitting for Nonconvex Sparsity Optimization |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Q-Intersection Algorithms for Constraint-Based Robust Parameter Estimation |
✅ |
✅ |
❌ |
❌ |
✅ |
✅ |
✅ |
5 |
| Qualitative Planning with Quantitative Constraints for Online Learning of Robotic Behaviours |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Qualitative Reasoning with Modelica Models |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Quality-Based Learning for Web Data Classification |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Querying Inconsistent Description Logic Knowledge Bases under Preferred Repair Semantics |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
3 |
| R2: An Efficient MCMC Sampler for Probabilistic Programs |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| Ranking Tweets by Labeled and Collaboratively Selected Pairs with Transitive Closure |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| ReLISH: Reliable Label Inference via Smoothness Hypothesis |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Reasoning on LTL on Finite Traces: Insensitivity to Infiniteness |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
✅ |
3 |
| Recommendation by Mining Multiple User Behaviors with Group Sparsity |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Reconsidering Mutual Information Based Feature Selection: A Statistical Significance View |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |
| Recovering from Selection Bias in Causal and Statistical Inference |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Regret Transfer and Parameter Optimization |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Regret-Based Multi-Agent Coordination with Uncertain Task Rewards |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Regret-Based Optimization and Preference Elicitation for Stackelberg Security Games with Uncertainty |
✅ |
❌ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| Reinforcement Learning on Multiple Correlated Signals |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Relational One-Class Classification: A Non-Parametric Approach |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Relaxation Search: A Simple Way of Managing Optional Clauses |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| RepRev: Mitigating the Negative Effects of Misreported Ratings |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Representing Words as Lymphocytes |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Reputation-Aware Continuous Double Auction |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Robot Team Exploration with Communication Restrictions |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Robust Bayesian Inverse Reinforcement Learning with Sparse Behavior Noise |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Robust Distance Metric Learning in the Presence of Label Noise |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
3 |
| Robust Multi-View Spectral Clustering via Low-Rank and Sparse Decomposition |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Robust Non-Negative Dictionary Learning |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Robust Visual Robot Localization Across Seasons Using Network Flows |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Robust Winners and Winner Determination Policies under Candidate Uncertainty |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Role-Aware Conformity Modeling and Analysis in Social Networks |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Roles and Teams Hedonic Games |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Rounded Dynamic Programming for Tree-Structured Stochastic Network Design |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| SOML: Sparse Online Metric Learning with Application to Image Retrieval |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| SUIT: A Supervised User-Item Based Topic Model for Sentiment Analysis |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Sample-adaptive Multiple Kernel Learning |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Saturated Path-Constrained MDP: Planning under Uncertainty and Deterministic Model-Checking Constraints |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| Scalable Complex Contract Negotiation with Structured Search and Agenda Management |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Scalable Sparse Covariance Estimation via Self-Concordance |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Schedule-Based Robotic Search for Multiple Residents in a Retirement Home Environment |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Scheduling for Transfers in Pickup and Delivery Problems with Very Large Neighborhood Search |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Semantic Data Representation for Improving Tensor Factorization |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Semantic Graph Construction for Weakly-Supervised Image Parsing |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Semantic Segmentation Using Multiple Graphs with Block-Diagonal Constraints |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Semantical Clustering of Morphologically Related Chinese Words |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Semi-Supervised Matrix Completion for Cross-Lingual Text Classification |
✅ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
3 |
| SenticNet 3: A Common and Common-Sense Knowledge Base for Cognition-Driven Sentiment Analysis |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Sequential Click Prediction for Sponsored Search with Recurrent Neural Networks |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
✅ |
2 |
| Signals in the Silence: Models of Implicit Feedback in a Recommendation System for Crowdsourcing |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Signed Laplacian Embedding for Supervised Dimension Reduction |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Similarity-Preserving Binary Signature for Linear Subspaces |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Simpler Bounded Suboptimal Search |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Simultaneous Cake Cutting |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Sketch Recognition with Natural Correction and Editing |
❌ |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
3 |
| Small-Variance Asymptotics for Dirichlet Process Mixtures of SVMs |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Social Capital in Network Organizations |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Social Planning: Achieving Goals by Altering Others’ Mental States |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Solving Imperfect Information Games Using Decomposition |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
3 |
| Solving Semantic Problems Using Contexts Extracted from Knowledge Graphs |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| Solving Uncertain MDPs by Reusing State Information and Plans |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Solving Zero-Sum Security Games in Discretized Spatio-Temporal Domains |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Solving the Inferential Frame Problem in the General Game Description Language |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Solving the Traveling Tournament Problem by Packing Three-Vertex Paths |
✅ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
5 |
| Source Free Transfer Learning for Text Classification |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Sparse Compositional Metric Learning |
❌ |
✅ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Sparse Learning for Stochastic Composite Optimization |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Spatial Scan for Disease Mapping on a Mobile Population |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Spatio-Temporal Consistency as a Means to Identify Unlabeled Objects in a Continuous Data Field |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Spectral Thompson Sampling |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| State Aggregation in Monte Carlo Tree Search |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Stochastic Privacy |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Strategyproof Exchange with Multiple Private Endowments |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Structured Possibilistic Planning Using Decision Diagrams |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Sub-Selective Quantization for Large-Scale Image Search |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
3 |
| Supervised Hashing for Image Retrieval via Image Representation Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Supervised Scoring with Monotone Multidimensional Splines |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Supervised Transfer Sparse Coding |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Symbolic Domain Predictive Control |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Symbolic Model Checking Epistemic Strategy Logic |
❌ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
2 |
| Synthesis of Geometry Proof Problems |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
✅ |
3 |
| TacTex’13: A Champion Adaptive Power Trading Agent |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Tailoring Local Search for Partial MaxSAT |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Testable Implications of Linear Structural Equation Models |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| The Complexity of Reasoning with FODD and GFODD |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Computational Complexity of Structure-Based Causality |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Computational Rise and Fall of Fairness |
❌ |
✅ |
❌ |
❌ |
✅ |
✅ |
✅ |
4 |
| The Effect of Similarity between Human and Machine Action Choices on Adaptive Automation Performance |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| The Fisher Market Game: Equilibrium and Welfare |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| The Importance of Cognition and Affect for Artificially Intelligent Decision Makers |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| The Most Uncreative Examinee: A First Step toward Wide Coverage Natural Language Math Problem Solving |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
✅ |
2 |
| The Role of Dimensionality Reduction in Classification |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| The Semantic Interpretation of Trust in Multiagent Interactions |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Theory of Cooperation in Complex Social Networks |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Tightening Bounds for Bayesian Network Structure Learning |
❌ |
❌ |
✅ |
❌ |
✅ |
❌ |
❌ |
2 |
| To Share or Not to Share? The Single Agent in a Team Decision Problem |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
1 |
| TopicMF: Simultaneously Exploiting Ratings and Reviews for Recommendation |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Towards Scalable Exploration of Diagnoses in an Ontology Stream |
✅ |
❌ |
❌ |
❌ |
✅ |
❌ |
❌ |
2 |
| Towards Topological-Transformation Robust Shape Comparison: A Sparse Representation Based Manifold Embedding Approach |
❌ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
2 |
| Tractability through Exchangeability: A New Perspective on Efficient Probabilistic Inference |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Tree-Based On-Line Reinforcement Learning |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Trust Prediction with Propagation and Similarity Regularization |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
3 |
| Two Case Studies for Trading Multiple Indivisible Goods with Indifferences |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Type-Based Exploration with Multiple Search Queues for Satisficing Planning |
❌ |
❌ |
✅ |
❌ |
✅ |
✅ |
✅ |
4 |
| Uncorrelated Multi-View Discrimination Dictionary Learning for Recognition |
✅ |
❌ |
✅ |
✅ |
❌ |
❌ |
✅ |
4 |
| Uncovering Hidden Structure through Parallel Problem Decomposition |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Unsupervised Alignment of Natural Language Instructions with Video Segments |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| User Group Oriented Temporal Dynamics Exploration |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| User Intent Identification from Online Discussions Using a Joint Aspect-Action Topic Model |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
1 |
| Using Model-Based Diagnosis to Improve Software Testing |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
✅ |
3 |
| Using Narrative Function to Extract Qualitative Information from Natural Language Texts |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| Using Response Functions to Measure Strategy Strength |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Using The Matrix Ridge Approximation to Speedup Determinantal Point Processes Sampling Algorithms |
✅ |
❌ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Using Timed Game Automata to Synthesize Execution Strategies for Simple Temporal Networks with Uncertainty |
❌ |
✅ |
✅ |
❌ |
✅ |
❌ |
✅ |
4 |
| Voting with Rank Dependent Scoring Rules |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
0 |
| Where and Why Users “Check In” |
❌ |
❌ |
✅ |
✅ |
❌ |
❌ |
❌ |
2 |
| Who Also Likes It? Generating the Most Persuasive Social Explanations in Recommender Systems |
❌ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
1 |
| Wormhole Hamiltonian Monte Carlo |
✅ |
❌ |
❌ |
❌ |
❌ |
❌ |
✅ |
2 |
| Worst-Case Solution Quality Analysis When Not Re-Expanding Nodes in Best-First Search |
✅ |
❌ |
✅ |
❌ |
❌ |
❌ |
❌ |
2 |
| k-CoRating: Filling Up Data to Obtain Privacy and Utility |
✅ |
❌ |
✅ |
✅ |
✅ |
❌ |
✅ |
5 |