Publications

Export 7151 results:
Author Title [ Type(Asc)] Year
Journal Articles
Last M, Luta G, Orso A, Porter A, Young S.  2008.  Pooled ANOVA. Computational Statistics & Data Analysis. 52(12):5215-5228.
Pickart CM, Fushman D.  2004.  Polyubiquitin chains: polymeric protein signals. Current Opinion in Chemical Biology. 8(6):610-616.
Schurr SP, O'Leary DP, Tits A'L.  2009.  A Polynomial-Time Interior-Point Method for Conic Optimization, with Inexact Barrier Evaluations. SIAM Journal on Optimization. 20:548-571.
Hannenhalli S.  1996.  Polynomial-time algorithm for computing translocation distance between genomes. Discrete Applied Mathematics. 71(1–3):137-151.
Elman H, Streit R.  1986.  Polynomial iteration for nonsymmetric indefinite linear systems. Numerical Analysis. :103-117.
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.
Neumann J, Fermüller C, Aloimonos Y.  2002.  Polydioptric cameras: New eyes for structure from motion. Pattern Recognition. :618-625.
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.
Mount D, Gable CW.  2001.  A point-placement strategy for conforming Delaunay tetrahedralization. International Journal of Computational Geometry & Applications. 11(6):669-682.
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.
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.
Neumann J, Fermüller C.  2003.  Plenoptic video geometry. The Visual Computer. 19(6):395-404.
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
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.
Memon AM, Pollack ME, Soffa ML.  2000.  A planning-based approach to GUI testing. Proceedings of The 13th International Software/Internet Quality Week.
Sheshagiri M, desJardins M, Finin T.  2003.  A planner for composing services described in DAML-S. International Conference on Automated Planning and Scheduling (ICAPS) 2003 Workshop on planning for web services.
Zotkin DN, Duraiswami R, Gumerov NA.  2010.  Plane-Wave Decomposition of Acoustical Scenes Via Spherical and Cylindrical Microphone Arrays. IEEE Transactions on Audio, Speech, and Language Processing. 18(1):2-16.
Khuller S, Vazirani VV.  1991.  Planar graph coloring is not self-reducible, assuming P ≠ NP. Theoretical Computer Science. 88(1):183-189.
Hicks MW, Kakkar P, Moore JT, Gunter CA, Alexander DS, Nettles S.  1998.  The PLAN system for building Active Networks. University of Pennsylvania (February 27, 1998).
Hicks MW.  1999.  PLAN Service Programmer's Guide for PLAN version 3.2. University of Pennsylvania.
Hicks MW.  1998.  PLAN Service Programmer's Guide. University of Pennsylvania.
Hicks MW, Kakkar P, Moore JT, Gunter CA, Nettles S.  1999.  PLAN: A programming language for active networks. ACM SIGPLAN NOTICES. 34:86-93.
Hicks MW, Kakkar P, Moore JT, Gunter CA, Nettles S.  1998.  PLAN: a packet language for active networks. SIGPLAN Not.. 34(1):86-93.
Potter R, Shneiderman B.  1999.  Pixel Data Access for End-User Programming and Graphical Macros. Technical Reports from UMIACS.
Kilmer ME, O'Leary DP.  1999.  Pivoted Cauchy-Like Preconditioners for Regularized Solution of Ill-Posed Problems. SIAM Journal on Scientific Computing. 21:88-110.

Pages