Publications

Export 7151 results:
Author [ Title(Desc)] Type Year
Filters: Genomic-analysis-icevchban8-atypical-genetic-element-vibrio-cholerae is   [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 
P
Dix J, Muñoz-Avila H, Nau DS, Zhang L.  2002.  Planning in a multi-agent environment: theory and practice. :944-945.
Dix J, Kuter U, Nau DS.  2003.  Planning in Answer Set Programming Using Ordered Task Decomposition. KI 2003: Advances in Artificial Intelligence. 2821:490-504.
Memon AM, Pollack ME, Soffa ML.  2000.  A planning-based approach to GUI testing. Proceedings of The 13th International Software/Internet Quality Week.
Bienkowski MA, desJardins M.  1994.  Planning-based integrated decision support systems. Artificial Intelligence Planning Systems: Proceedings of the Second International Conference (AIPS-94). :196-201.
Stantchev G, Juba D, Dorland W, Varshney A.  2007.  Plasma Turbulence Simulation and Visualization on Graphics Processors: Efficient Parallel Computing on the Desktop. Bulletin of the American Physical Society. Volume 52, Number 11
Smolyaninov II, Vishkin U, Davis CC.  2010.  Plasmonic Systems and Devices Utilizing Surface Plasmon Polariton. 12/697,595
Vishkin U, Smolyaninov I, Davis C.  2007.  Plasmonics and the parallel programming problem. Society of Photo-Optical Instrumentation Engineers (SPIE) Conference Series. 6477:19-19.
Sherwood R, Spring N.  2006.  A platform for unobtrusive measurements on PlanetLab. Proceedings of the 3rd conference on USENIX Workshop on Real, Large Distributed Systems - Volume 3. :2-2.
desJardins M, Ciavolino A, Deloatch R, Feasley E.  2011.  Playing to Program: Towards an Intelligent Programming Tutor for RUR-PLE. Second AAAI Symposium on Educational Advances in Artificial Intelligence.
Neumann J, Fermüller C.  2003.  Plenoptic video geometry. The Visual Computer. 19(6):395-404.
Zelkowitz MV.  1976.  PL/I Programming with PLUM.
Khella A, Bederson BB.  2004.  Pocket PhotoMesa: a Zoomable image browser for PDAs. Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia. :19-24.
Arkin E, Goodrich M, Mitchell J, Mount D, Piatko C, Skiena S.  1993.  Point probe decision trees for geometric concept classes. Algorithms and Data Structures. :95-106.
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.
Murphy M, Mount D, Gable CW.  2000.  A point-placement strategy for conforming Delaunay tetrahedralization. Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms. :67-74.
Mount D, Gable CW.  2001.  A point-placement strategy for conforming Delaunay tetrahedralization. International Journal of Computational Geometry & Applications. 11(6):669-682.
Kurkulos M, Weinberg JM, Pepling ME, Mount SM.  1991.  Polyadenylylation in copia requires unusually distant upstream sequences. Proceedings of the National Academy of SciencesPNAS. 88(8):3038-3042.
Neumann J, Fermüller C, Aloimonos Y.  2003.  Polydioptric camera design and 3D motion estimation. 2003 IEEE Computer Society Conference on Computer Vision and Pattern Recognition, 2003. Proceedings. 2:II-294-301vol.2-II-294-301vol.2.
Neumann J, Fermüller C, Aloimonos Y.  2002.  Polydioptric cameras: New eyes for structure from motion. Pattern Recognition. :618-625.
Neumann J, Fermüller C, Aloimonos Y.  2002.  Polydioptric Cameras: New Eyes for Structure from Motion. Pattern RecognitionPattern Recognition. 2449:618-625.
Espeland EM, Lipp EK, Huq A, Colwell RR.  2004.  Polylysogeny and prophage induction by secondary infection in Vibrio cholerae. Environmental Microbiology. 6(7):760-763.
Foster JS, Fahndrich M, Aiken A.  2000.  Polymorphic versus monomorphic points-to analysis. Proceedings of the 7th International Static Analysis Symposium, Lecture Notes in Computer Science. Springer Verlag.
Elman H, Streit R.  1986.  Polynomial iteration for nonsymmetric indefinite linear systems. Numerical Analysis. :103-117.
Hannenhalli S.  1996.  Polynomial-time algorithm for computing translocation distance between genomes. Discrete Applied Mathematics. 71(1–3):137-151.
Hannenhalli S.  1995.  Polynomial-time algorithm for computing translocation distance between genomes. Combinatorial Pattern MatchingCombinatorial Pattern Matching. 937:162-176.

Pages