default search action
ISAIM 2014: Fort Lauderdale, Florida, USA
- International Symposium on Artificial Intelligence and Mathematics, ISAIM 2014, Fort Lauderdale, FL, USA, January 6-8, 2014. 2014
Regular Track
- Theja Tulabandhula, Cynthia Rudin:
Generalization Bounds for Learning with Linear and Quadratic Side Knowledge. - Piotr Wojciechowski, Pavlos Eirinakis, K. Subramani:
Variants of Quantified Linear Programming and Quantified Linear Implication. - André Abramé, Djamal Habet, Donia Toumi:
Improving Configuration Checking for Satisfiable Random k-SAT Instances. - Lev Reyzin:
On Boosting Sparse Parities. - Xia Qu, Prashant Doshi:
Behavioral Modeling of Sequential Bargaining Games: Fairness and Limited Backward Induction. - Gabriele Kern-Isberner, Marco Wilhelm, Christoph Beierle:
Probabilistic Knowledge Representation Using Gröbner Basis Theory. - Salem Benferhat, Zied Bouraoui, Odile Papini, Éric Würbel:
Assertional-based Removed Set Revision of DL-LiteR Belief Bases. - Richard E. Korf, Ethan L. Schreiber, Michael D. Moffitt:
Optimal Sequential Multi-Way Number Partitioning. - Philippe Jégou, Cyril Terrioux:
Bag-Connected Tree-Width: A New Parameter for Graph Decomposition. - Tomohiko Okayama, Ryo Yoshinaka, Keisuke Otaki, Akihiro Yamamoto:
A Sufficient Condition for Learning Unbounded Unions of Languages with Refinement Operators. - Natalia Flerova, Radu Marinescu, Rina Dechter:
Weighted Best First Search for Graphical Models.
Special session on Boolean and pseudo-Boolean Functions
- Sarah R. Allen, Lisa Hellerstein, Devorah Kletenik, Tonguç Ünlüyurt:
Evaluation of DNF Formulas. - Pedro Barahona, Steffen Hölldobler, Van-Hau Nguyen:
Efficient SAT-Encoding of Linear CSP Constraints. - Tibérius O. Bonates, José W. V. Morais Neto:
Reversing the Classification of Weighted Rule Ensembles. - Endre Boros, Isabella Lari:
Cones of Nonnegative Quadratic Pseudo-Boolean Functions. - Ondrej Cepek, Stefan Gurský:
On the Gap between the Complexity of SAT and Minimization for Certain Classes of Boolean Formulas. - Nina Chiarelli, Martin Milanic:
Linear Separation of Connected Dominating Sets in Graphs. - Ferdinando Cicalese, Eduardo Sany Laber, Aline Medeiros Saettler:
Function Evaluation: decision trees optimizing simultaneously worst and expected testing cost. - André A. Ciré, John N. Hooker:
The Separation Problem for Binary Decision Diagrams. - Daya Ram Gaur:
On Resolution Like Proofs of Monotone Self-Dual Functions. - Utz-Uwe Haus, Carla Michini:
Representations of All Solutions of Boolean Programming Problems. - Saïd Jabbour, Lakhdar Saïs, Yakoub Salhi:
A Pigeon-Hole Based Encoding of Cardinality Constraints. - Petr Kucera:
Hydras: Complexity on general graphs and a subclass of trees. - Mohammad Al-Saedi, Éric Grégoire, Bertrand Mazure, Lakhdar Saïs:
About Some UP-Based Polynomial Fragments of SAT. - Takahisa Toda:
Dualization of Boolean functions Using Ternary Decision Diagrams. - Andreas Wotzlaw, Ewald Speckenmeyer, Stefan Porschen:
Probabilistic Analysis of Random Mixed Horn Formulas.
Special Session on Computational Social Choice
- Umberto Grandi, Andrea Loreggia, Francesca Rossi, Vijay A. Saraswat:
From Sentiment Analysis to Preference Aggregation. - Vincent Conitzer:
The Maximum Likelihood Approach to Voting on Social Networks. - Lirong Xia:
Assigning indivisible and categorized items. - Anja Rey, Jörg Rothe, Hilmar Schadrack, Lena Schend:
Toward the Complexity of the Existence of Wonderfully Stable Partitions and Strictly Core Stable Coalition Structures in Hedonic Games. - Felix Brandt, Markus Brill, Paul Harrenstein:
Extending Tournament Solutions.
Special Session on Mathematical Theories of Natural Language Processing
- Meaghan Fowlie:
Learning Optionality and Repetition. - Sean A. Fulop, Sylvain Neuvel:
Networks of morphological relations. - Gianluca Giorgolo, Ash Asudeh:
Monads for composing categorical and probabilistic meanings. - Mans Hulden, Miikka Silfverberg:
Finite-state subset approximation of phrase structure. - James Rogers:
Hybrid Distributions of Strings. - Erik Wennstrom:
Tableau-Based Model Generation for Relational Syllogistic Logics.
Special Session on Theory of Machine Learning
- Shai Ben-David, Ruth Urner:
The sample complexity of agnostic learning with deterministic labels. - Jonathan H. Huggins, Cynthia Rudin:
Toward a Theory of Pattern Discovery. - Dan Gutfreund, Aryeh Kontorovich, Ran Levy, Michal Rosen-Zvi:
Boosting Conditional Probability Estimators. - Ruitong Huang, Csaba Szepesvári:
Generalization Bounds for Partially Linear Models. - Theja Tulabandhula, Cynthia Rudin:
Robust Optimization using Machine Learning for Uncertainty Sets.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: