2008 | ||
---|---|---|
90 | David A. McAllester, Petri Myllymäki: UAI 2008, Proceedings of the 24th Conference in Uncertainty in Artificial Intelligence, July 9-12, 2008, Helsinki, Finland AUAI Press 2008 | |
89 | EE | Pedro F. Felzenszwalb, David A. McAllester, Deva Ramanan: A discriminatively trained, multiscale, deformable part model. CVPR 2008 |
88 | EE | Hoang Trinh, David A. McAllester: Particle-Based Belief Propagation for Structure from Motion and Dense Stereo Vision with Unknown Camera Constraints. RobVis 2008: 16-28 |
87 | EE | David A. McAllester, Michael Collins, Fernando Pereira: Case-factor diagrams for structured probabilistic modeling. J. Comput. Syst. Sci. 74(1): 84-96 (2008) |
2007 | ||
86 | EE | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The Communication Complexity of Correlation. IEEE Conference on Computational Complexity 2007: 10-23 |
85 | EE | Pedro F. Felzenszwalb, David A. McAllester: The Generalized A* Architecture. J. Artif. Intell. Res. (JAIR) 29: 153-190 (2007) |
2006 | ||
84 | EE | Prahladh Harsha, Rahul Jain, David A. McAllester, Jaikumar Radhakrishnan: The communication complexity of correlation. Electronic Colloquium on Computational Complexity (ECCC) 13(151): (2006) |
83 | EE | Matthias Blume, David A. McAllester: Sound and complete models of contracts. J. Funct. Program. 16(4-5): 375-414 (2006) |
2005 | ||
82 | EE | Scott Sanner, David A. McAllester: Affine Algebraic Decision Diagrams (AADDs) and their Application to Structured Probabilistic Inference. IJCAI 2005: 1384-1390 |
81 | EE | Yasemin Altun, David A. McAllester, Mikhail Belkin: Margin Semi-Supervised Learning for Structured Variables. NIPS 2005 |
2004 | ||
80 | EE | Matthias Blume, David A. McAllester: A sound (and complete) model of contracts. ICFP 2004: 189-200 |
79 | EE | Peter L. Bartlett, Michael Collins, Benjamin Taskar, David A. McAllester: Exponentiated Gradient Algorithms for Large-margin Structured Classification. NIPS 2004 |
78 | EE | David A. McAllester, Michael Collins, Fernando Pereira: Case-Factor Diagrams for Structured Probabilistic Modeling. UAI 2004: 382-391 |
77 | EE | John Langford, David A. McAllester: Computable Shell Decomposition Bounds. Journal of Machine Learning Research 5: 529-547 (2004) |
2003 | ||
76 | EE | David A. McAllester: Simplified PAC-Bayesian Margin Bounds. COLT 2003: 203-215 |
75 | EE | David A. McAllester: Joint RTA-TLCA Invited Talk: A Logical Algorithm for ML Type Inference. RTA 2003: 436-451 |
74 | EE | Peter Stone, Robert E. Schapire, Michael L. Littman, János A. Csirik, David A. McAllester: Decision-Theoretic Bidding Based on Learned Density Models in Simultaneous, Interacting Auctions. J. Artif. Intell. Res. (JAIR) 19: 209-242 (2003) |
73 | EE | David A. McAllester, Luis E. Ortiz: Concentration Inequalities for the Missing Mass and for Histogram Rule Error. Journal of Machine Learning Research 4: 895-911 (2003) |
72 | David A. McAllester: PAC-Bayesian Stochastic Model Selection. Machine Learning 51(1): 5-21 (2003) | |
2002 | ||
71 | EE | Peter Stone, Robert E. Schapire, János A. Csirik, Michael L. Littman, David A. McAllester: ATTac-2001: A Learning, Autonomous Bidding Agent. AMEC 2002: 143-160 |
70 | EE | Harald Ganzinger, David A. McAllester: Logical Algorithms. ICLP 2002: 209-223 |
69 | Robert E. Schapire, Peter Stone, David A. McAllester, Michael L. Littman, János A. Csirik: Modeling Auction Price Uncertainty Using Boosting-based Conditional Density Estimation. ICML 2002: 546-553 | |
68 | EE | David A. McAllester, Luis E. Ortiz: Concentration Inequalities for the Missing Mass and for Histogram Rule Error. NIPS 2002: 351-358 |
67 | EE | Robert Givan, David A. McAllester: Polynomial-time computation via local inference relations. ACM Trans. Comput. Log. 3(4): 521-541 (2002) |
66 | EE | Robert Givan, David A. McAllester, Carl Witty, Dexter Kozen: Tarskian Set Constraints. Inf. Comput. 174(2): 105-131 (2002) |
65 | EE | David A. McAllester: On the complexity analysis of static analyses. J. ACM 49(4): 512-537 (2002) |
64 | EE | Yishay Mansour, David A. McAllester: Boosting Using Branching Programs. J. Comput. Syst. Sci. 64(1): 103-112 (2002) |
2001 | ||
63 | EE | Peter Stone, David A. McAllester: An architecture for action selection in robotic soccer. Agents 2001: 316-323 |
62 | EE | Harald Ganzinger, David A. McAllester: A New Meta-complexity Theorem for Bottom-Up Logic Programs. IJCAR 2001: 514-528 |
61 | EE | Sanjoy Dasgupta, Michael L. Littman, David A. McAllester: PAC Generalization Bounds for Co-training. NIPS 2001: 375-382 |
60 | EE | Andrew W. Appel, David A. McAllester: An indexed model of recursive types for foundational proof-carrying code. ACM Trans. Program. Lang. Syst. 23(5): 657-683 (2001) |
2000 | ||
59 | David A. McAllester: Automated Deduction - CADE-17, 17th International Conference on Automated Deduction, Pittsburgh, PA, USA, June 17-20, 2000, Proceedings Springer 2000 | |
58 | David A. McAllester, Robert E. Schapire: On the Convergence Rate of Good-Turing Estimators. COLT 2000: 1-6 | |
57 | Yishay Mansour, David A. McAllester: Boosting Using Branching Programs. COLT 2000: 220-224 | |
56 | John Langford, David A. McAllester: Computable Shell Decomposition Bounds. COLT 2000: 25-34 | |
55 | Yishay Mansour, David A. McAllester: Generalization Bounds for Decision Trees. COLT 2000: 69-74 | |
54 | EE | David A. McAllester: Meta-complexity Theorems: Talk Abstract. CP 2000: 13-17 |
53 | EE | William W. Cohen, Henry A. Kautz, David A. McAllester: Hardening soft information sources. KDD 2000: 255-259 |
52 | EE | David A. McAllester, Peter Stone: Keeping the Ball from CMUnited-99. RoboCup 2000: 333-338 |
51 | EE | Patrick Riley, Peter Stone, David A. McAllester, Manuela M. Veloso: ATT-CMUnited-2000: Third Place Finisher in the RoboCup-2000 Simulator League. RoboCup 2000: 489-492 |
50 | EE | Robert Givan, David A. McAllester: Polynomial-time Computation via Local Inference Relations CoRR cs.LO/0007020: (2000) |
1999 | ||
49 | Harald Ganzinger, David A. McAllester, Andrei Voronkov: Logic Programming and Automated Reasoning, 6th International Conference, LPAR'99, Tbilisi, Georgia, September 6-10, 1999, Proceedings Springer 1999 | |
48 | EE | Steven P. Abney, David A. McAllester, Fernando Pereira: Relating Probabilistic Grammars and Automata. ACL 1999 |
47 | EE | David A. McAllester: PAC-Bayesian Model Averaging. COLT 1999: 164-170 |
46 | EE | David A. McAllester: World-Modeling vs. World-Axiomatizing. LPNMR 1999: 375-388 |
45 | EE | Richard S. Sutton, David A. McAllester, Satinder P. Singh, Yishay Mansour: Policy Gradient Methods for Reinforcement Learning with Function Approximation. NIPS 1999: 1057-1063 |
44 | EE | Yishay Mansour, David A. McAllester: Boosting with Multi-Way Branching in Decision Trees. NIPS 1999: 300-306 |
43 | EE | David A. McAllester: On the Complexity Analysis of Static Analyses. SAS 1999: 312-329 |
42 | EE | David A. McAllester, Satinder P. Singh: Approximate Planning for Factored POMDPs using Belief State Simplification. UAI 1999: 409-416 |
41 | David A. McAllester: Some PAC-Bayesian Theorems. Machine Learning 37(3): 355-363 (1999) | |
1998 | ||
40 | EE | David A. McAllester: Some PAC-Bayesian Theorems. COLT 1998: 230-234 |
39 | Witold Charatonik, David A. McAllester, Damian Niwinski, Andreas Podelski, Igor Walukiewicz: The Horn Mu-calculus. LICS 1998: 58-69 | |
1997 | ||
38 | David A. McAllester, Bart Selman, Henry A. Kautz: Evidence for Invariants in Local Search. AAAI/IAAI 1997: 321-326 | |
37 | Daphne Koller, David A. McAllester, Avi Pfeffer: Effective Bayesian Inference for Stochastic Programs. AAAI/IAAI 1997: 740-747 | |
36 | Nevin Heintze, David A. McAllester: On the Complexity of Set-Based Analysis. ICFP 1997: 150-163 | |
35 | Bart Selman, Henry A. Kautz, David A. McAllester: Ten Challenges in Propositional Reasoning and Search. IJCAI (1) 1997: 50-54 | |
34 | EE | Nevin Heintze, David A. McAllester: On the Cubic Bottleneck in Subtyping and Flow Analysis. LICS 1997: 342-351 |
33 | Nevin Heintze, David A. McAllester: Linear-time Subtransitive Control Flow Analysis. PLDI 1997: 261-272 | |
1996 | ||
32 | David A. McAllester, Kostas Arkoudas: Walther Recursion. CADE 1996: 643-657 | |
31 | Henry A. Kautz, David A. McAllester, Bart Selman: Encoding Plans in Propositional Logic. KR 1996: 374-384 | |
30 | David A. McAllester, Robert Givan, Carl Witty, Dexter Kozen: Tarskian Set Constraints. LICS 1996: 138-147 | |
29 | David A. McAllester: The Rise of Nonlinear Mathematical Programming. ACM Comput. Surv. 28(4es): 68 (1996) | |
1995 | ||
28 | David A. McAllester, J. Kucan, D. F. Otth: A Proof of Strong Normalization of F_2, F_omega and Beyond Inf. Comput. 121(2): 193-200 (1995) | |
1994 | ||
27 | Matthew L. Ginsberg, David A. McAllester: GSAT and Dynamic Backtracking. KR 1994: 226-237 | |
26 | Matthew L. Ginsberg, David A. McAllester: GSAT and Dynamic Backtracking. PPCP 1994: 243-265 | |
25 | Frédéric Benhamou, David A. McAllester, Pascal Van Hentenryck: CLP(Intervals) Revisited. SLP 1994: 124-138 | |
1993 | ||
24 | Jeffrey Mark Siskind, David A. McAllester: Nondeterministic Lisp as a Substrate for Constraint Logic Programming. AAAI 1993: 133-138 | |
23 | David A. McAllester: Bottom Up Logic Programming as an Inference Tool. ICTAI 1993: 8 | |
22 | EE | David A. McAllester, Robert Givan: Taxonomic Syntax for First Order Inference. J. ACM 40(2): 246-283 (1993) |
21 | EE | David A. McAllester: Automatic Recognition of Tractability in Inference Relations. J. ACM 40(2): 284-303 (1993) |
20 | David A. McAllester, Prakash Panangaden, Vasant Shanbhogue: Nonexpressibility of Fairness and Signaling. J. Comput. Syst. Sci. 47(2): 287-321 (1993) | |
19 | Hai-Ping Ko, David A. McAllester, Mark E. Nadel: Lower Bounds for the Lengths of Refutations. J. Log. Program. 17(1): 31-58 (1993) | |
1992 | ||
18 | David A. McAllester: Grammar Rewriting. CADE 1992: 124-138 | |
17 | Robert Givan, David A. McAllester: New Results on Local Inference Relations. KR 1992: 403-412 | |
16 | David A. McAllester, Robert Givan: Natural Language Syntax and First-Order Inference. Artif. Intell. 56(1): 1-20 (1992) | |
1991 | ||
15 | David A. McAllester, David Rosenblitt: Systematic Nonlinear Planning. AAAI 1991: 634-639 | |
14 | David A. McAllester: Observations on Cognitive Judgments. AAAI 1991: 910-914 | |
13 | Robert Givan, David A. McAllester, Sameer Shalaby: Natural Language Based Inference Procedures Applied to Schubert's Steamroller. AAAI 1991: 915-920 | |
12 | David A. McAllester: Socratic Sequent Systems. SIGART Bulletin 2(3): 98-100 (1991) | |
1990 | ||
11 | David A. McAllester: Truth Maintenance. AAAI 1990: 1109-1116 | |
1989 | ||
10 | David A. McAllester, Robert Givan, Tanveer Fatima: Taxonomic Syntax for First Order Inference. KR 1989: 289-300 | |
1988 | ||
9 | Ramin Zabih, David A. McAllester: A Rearrangement Search Strategy for Determining Propositional Satisfiability. AAAI 1988: 155-160 | |
8 | David A. McAllester: Ontic: A Knowledge Representation System for Mathematics. CADE 1988: 742-743 | |
7 | David A. McAllester, Prakash Panangaden, Vasant Shanbhogue: Nonexpressibility of Fairness and Signaling FOCS 1988: 377-386 | |
6 | Charles Elkan, David A. McAllester: Automated Inductive Reasoning about Logic Programs. ICLP/SLP 1988: 876-892 | |
5 | David A. McAllester: Conspiracy Numbers for Min-Max Search. Artif. Intell. 35(3): 287-310 (1988) | |
1987 | ||
4 | Ramin Zabih, David A. McAllester, David Chapman: Non-Deterministic Lisp with Dependency-directed Backtracking. AAAI 1987: 59-65 | |
1986 | ||
3 | David A. McAllester, Ramin Zabih: Boolean Classes. OOPSLA 1986: 417-423 | |
1984 | ||
2 | Joseph Y. Halpern, David A. McAllester: Likelihood, Probability, and Knowledge. AAAI 1984: 137-141 | |
1981 | ||
1 | David A. McAllester: Algebraic Approximations. IJCAI 1981: 1024-1026 |