Publications

Export 7148 results:
[ Author(Asc)] Title Type Year
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 
A
Ayan N F, Dorr BJ, Monz C.  2005.  Alignment link projection using transformation-based learning. Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing. :185-192.
Ayan N, Dorr BJ, Habash N.  2004.  Multi-align: Combining Linguistic and Statistical Techniques to Improve Alignments for Adaptable MT. Machine Translation: From Real Users to ResearchMachine Translation: From Real Users to Research. 3265:17-26.
Ayan NF, Dorr BJ, Kolak O.  2003.  Evaluation Techniques Applied to Domain Tuning of MT Lexicons. Proceedings of the Workshop “Towards Systematizing MT Evaluation. 27:3-11.
Ayan NF, Dorr BJ, Kolak O.  2003.  Domain Tuning of Bilingual Lexicons for MT.
Ayan NF, Dorr BJ.  2002.  Generating A Parsing Lexicon From Lexical-Conceptual Structure.
Ayan N F, Dorr BJ.  2006.  A maximum entropy approach to combining word alignments. Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics. :96-103.
Ayan N F, Dorr BJ.  2006.  Going beyond AER: an extensive analysis of word alignments and their impact on MT. Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics. :9-16.
Ayan NF, Dorr BJ.  2002.  Generating A Parsing Lexicon from an LCS-Based Lexicon. LREC 2002 Workshop Proceedings: Linguistic Knowledge Acquisition and Representation: Bootstrapping Annotated Language Data.
Axelrod A, Golbeck J, Shneiderman B.  2005.  Generating and Querying Semantic Web Environments for Photo Libraries (2005). Institute for Systems Research Technical Reports.
Auer P, Long PM, Srinivasan A.  1997.  Approximating hyper-rectangles: learning and pseudo-random sets. Proceedings of the twenty-ninth annual ACM symposium on Theory of computing. :314-323.
Au TC, Nau DS.  2006.  Maintaining cooperation in noisy environments. 21:1561-1561.
Au T-C, Kuter U, Nau DS.  2009.  Planning for Interactions among Autonomous Agents. Programming Multi-Agent Systems. 5442:1-23.
Au TC, Nau DS, V.S. Subrahmanian.  2004.  Utilizing volatile external information during planning. Proceedings of the European Conference on Artificial Intelligence (ECAI). :647-651.
Au T-C, Kraus S, Nau DS.  2008.  Synthesis of strategies from interaction traces. :855-862.
Au T-C, Kuter U, Nau DS.  2005.  Web Service Composition with Volatile Information. The Semantic Web – ISWC 2005. 3729:52-66.
Au T-C, Nau DS.  2007.  Reactive Query Policies: A Formalism for Planning with Volatile External Information. :243-250.
Au T-C, Muñoz-Avila H, Nau DS.  2002.  On the Complexity of Plan Adaptation by Derivational Analogy in a Universal Classical Planning Framework. Advances in Case-Based Reasoning. 2416:199-206.
Au TC, Nau DS.  2006.  Accident or intention: That is the question (in the noisy iterated prisoner’s dilemma). :561-568.
Au T, Nau DS.  2006.  The incompleteness of planning with volatile external information. FRONTIERS IN ARTIFICIAL IN℡LIGENCE AND APPLICATIONS. 141:839-839.
Ateniese G, Kamara S, Katz J.  2009.  Proofs of storage from homomorphic identification protocols. Advances in Cryptology–ASIACRYPT 2009. :319-333.
Atallah GC, Ball MO, Baras JS, Goli SK, Karne RK, Kelley S, Kumar HP, Plaisant C, Roussopoulos N, Shneiderman B et al..  1994.  Next Generation Network Management Technology. Institute for Systems Research Technical Reports.
Atallah M, Vishkin U.  1984.  Finding Euler tours in parallel* 1. Journal of Computer and System Sciences. 29(3):330-337.
Atalay FB, Mount D.  2002.  Ray interpolants for fast raytracing reflections and refractions. Journal of WSCG (Proc. International Conf. in Central Europe on Comp. Graph., Visualization and Comp. Vision). 10(3):1-8.
Atalay FB, Mount D, Mitchell J.  2007.  Pointerless implementation of hierarchical simplicial meshes and efficient neighbor finding in arbitrary dimensions. International Journal of Computational Geometry and Applications. 17(6):595-631.
Atalay F, Mount D.  2006.  The cost of compatible refinement of simplex decomposition trees. Proceedings of the 15th International Meshing Roundtable. :57-69.

Pages