Publications

Search
Export 479 results:
[ Author(Asc)] Title Type Year
Filters: First Letter Of Last Name is D  [Clear All Filters]
A B C D E F G H I J K L M N O P Q R S T U V W X Y Z 
D
Dillencourt MB, Mount D, Saalfeld AJ.  1993.  On The Maximum Number of Intersections of Two Polyhedra in 2 and 3 Dimensions. Proceedings of the Fifth Canadian Conference on Computational Geometry, Waterloo, Ontario. :49-54.
Dillencourt MB, Mount D, Netanyahu NS.  1992.  A randomized algorithm for slope selection. International Journal of Computational Geometry and Applications. 2(1):1-27.
Dikshit P, Guimaraes K, Ramamurthy M, Agrawala AK, Larsen RL.  1989.  Dynamic bin packing problem. SIAM Journal on Computing. 12(14):227-258.
Dietterich TG, Domingos P, Getoor L, Muggleton S, Tadepalli P.  2008.  Structured machine learning: the next ten years. Machine Learning. 73(1):3-23.
Diehl S, Diehl F, El-Sayed NM, Clayton C, Hoheisel JD.  2002.  Analysis of stage-specific gene expression in the bloodstream and the procyclic form of Trypanosoma brucei using a genomic DNA-microarray. Molecular and Biochemical Parasitology. 123(2):115-123.
Diehl CP, Namata G, Getoor L.  2007.  Relationship identification for social network discovery. PROCEEDINGS OF THE NATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE. 22(1):546-546.
Diehl CP, Getoor L, Namata G.  2006.  Name reference resolution in organizational email archives. SIAM International Conference on Data Mining. :20-22.
Dickinson BC, Varadan R, Fushman D.  2007.  Effects of cyclization on conformational dynamics and binding properties of Lys48-linked di-ubiquitin. Protein Science. 16(3):369-378.
Dickerson JP, Simari GI, V.S. Subrahmanian, Kraus S.  2010.  A graph-theoretic approach to protect static and moving targets from adversaries. Proceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 1. :299-306.
Diab M, Resnik P.  2002.  An unsupervised method for word sense tagging using parallel corpora. Proceedings of the 40th Annual Meeting on Association for Computational Linguistics. :255-262.
Di Persio T, Isbister D, Shneiderman B.  1980.  An experiment using memorization/reconstruction as a measure of programmer ability. International Journal of Man-Machine Studies. 13(3):339-354.
Di Crescenzo G, Katz J, Ostrovsky R, Smith A.  2001.  Efficient and Non-interactive Non-malleable Commitment. Advances in Cryptology — EUROCRYPT 2001Advances in Cryptology — EUROCRYPT 2001. 2045:40-59.
Di Bonaventura M P, DeSalle R, Pop M, Nagarajan N, Figurski DH, Fine DH, Kaplan JB, Planet PJ.  2009.  Complete Genome Sequence of Aggregatibacter (Haemophilus) Aphrophilus NJ8700. Journal of BacteriologyJ. Bacteriol.. 191(14):4693-4694.
Dhaliwal S, Gupta SK, Huang J, Kumar M.  2001.  A feature-based approach to automated design of multi-piece sacrificial molds. Journal of Computing and Information Science in Engineering. 1:225-225.
Dhaliwal S, Gupta SK, Huang J, Priyadarshini A.  2003.  Algorithms for computing global accessibility cones. Journal of Computing and Information Science in Engineering. 3:200-200.
Dhaliwal S, Gupta SK, Huang J, Kumar M.  2002.  A Step Towards Automated Design of Multi-Piece Sacrificial Molds. 3:337-347.
Dewey FE, Perez MV, Wheeler MT, Watt C, Spin J, Langfelder P, Horvath S, Hannenhalli S, Cappola TP, Ashley EA.  2011.  Gene Coexpression Network Topology of Cardiac Development, Hypertrophy, and FailureClinical Perspective. Circulation: Cardiovascular GeneticsCirc Cardiovasc Genet. 4(1):26-35.
desJardins M.  1994.  Evaluation of learning biases using probabilistic domain knowledge. Proceedings of the workshop on Computational learning theory and natural learning systems (vol. 2) : intersections between theory and experiment: intersections between theory and experiment. :97-112.
desJardins M.  1995.  How to succeed in graduate school: a guide for students and advisors: part II of II. Crossroads. 1(3):1-6.
desJardins M, Littman M.  2010.  Broadening student enthusiasm for computer science with a great insights course. Proceedings of the 41st ACM technical symposium on Computer science education. :157-161.
desJardins M.  1995.  How to succeed in graduate school: A guide for students and advisors. International Amateur-Professional Photoelectric Photometry Communications. 58:15-15.
desJardins M, Rathod P, Getoor L.  2008.  LEARNING STRUCTURED BAYESIAN NETWORKS: COMBINING ABSTRACTION HIERARCHIES AND TREE‐STRUCTURED CONDITIONAL PROBABILITY TABLES. Computational Intelligence. 24(1):1-22.
desJardins M, Sahami M, Wagstaff K.  2011.  EAAI-10: The First Symposium on Educational Advances in Artificial Intelligence. AI Magazine. 32(1):91-91.
desJardins M, Durfee EH, Ortiz J., Wolverton MJ.  1999.  A Survey of Research in Distributed, Continual Planning. AI Magazine. 20(4):13-13.
desJardins M.  2008.  How to succeed in graduate school: a guide for students and advisors. Crossroads. 14(4):5-9.

Pages