Publications

Found 4258 results
Author [ Title(Asc)] 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 
P
Ladkin, P. (1989).  The Possibility of an Executable Specification Language.
Hamann, C. M., & Chtcherbanski L. (1997).  Positional Logic Algebra - PLA - A Fascinating Alternative Approach.
Zhang, N., Farrell R., & Darrell T. (2012).  Pose Pooling Kernels for Sub-Category Recognition. 3665-3672.
Stoutamire, D. (1997).  Portable, Modular Expression of Locality.
Bernardis, E., & Yu S. X. (2011).  Pop Out Many Small Structures from a Very Large Microscopic Image. Medical Image Analysis. 690-707.
Gramm, J. (2004).  A Polynomial-Time Algorithm for the Matching of Crossing Contact-Map Patterns. Proceedings of the Fourth International Workshop on Algorithms in Bioinformatics (WABI 2004).
Bertoni, A., Campadelli P., Morpurgo A., & Panizza S. (1992).  Polynomial Uniform Convergence and Polynomial-Sample Learnability.
Karpinski, M. (1997).  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
Arora, S., Karger D. R., & Karpinski M. (1995).  Polynomial Time Approximation Schemes for Dense Instances of $NP$-HardProblems.
W. de la Vega, F., & Karpinski M. (1997).  Polynomial Time Approximation of Dense Weighted Instances of MAX-CUT.
Karpinski, M., & Macintyre A. (1995).  Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks.
Skibola, C. F., Bracci P. M., Halperin E., Nieters A., Hubbard A., Paynter R. A., et al. (2008).  Polymorphisms in the Estrogen Receptor 1 and Vitamin C and Matrix Metalloproteinase Gene Families Are Associated with Susceptibility to Lymphoma. PLoS ONE. 3(7), 
Maresca, M. (1991).  Polymorphic Processor Arrays.
Halperin, E., & Krauthgamer R. (2003).  Polylogarithmic Inapproximability. Proceedings of the 35th Annual ACM Symposium on Theory of Computing (STOC).
Althaus, E., & Fink C.. (2002).  A Polyhedral Approach to Surface Reconstruction from Planar Contours. Proceedings of the Ninth Conference on Integer Programming and Combinatorial Optimization.
Kreibich, C., & Sommer R. (2005).  Policy-Controlled Event Management for Distributed Intrusion Detection. Proceedings of the Fourth International Workshop on Distributed Event-Based Systems (DEBS) (ICDCSW'05). 4, 385-391.
Seehra, A.., Naous J.., Walfish M., Mazieres D.., Nicolosi A.., & Shenker S. J. (2009).  A Policy Framework for the Future Internet. 1-6.
Kutylowski, M., & Wanka R. (1997).  Playing Tetris on Meshes and Multi-Dimensional Shearsort.
Friedrich, T., Hebbinghaus N., & Neumann F. (2010).  Plateaus Can Be Harder in Multi-Objective Optimization. Theoretical Computer Science. 411(6), 854-864.
De Micheli, E., & Verri A. (1992).  Planar Passive Navigation: One Dimension Is Better Than Two.
Lokshtanov, D., Mnich M., & Saurabh S. (2011).  Planar k-Path in Subexponential Time and Polynomial Space.
Frederickson, G. N. (1989).  Planar Graph Decomposition and All Pairs Shortest Paths.
Choi, J., Thomee B., Friedland G., Cao L., Ni K., Borth D., et al. (2014).  The Placing Task: A Large-Scale Geo-Estimation Challenge for Social-Media Videos and Images. 27-31.
Gonzalez, J. Maria, & Paxson V. (2003).  Pktd: A Packet Capture and Injection Daemon. Proceedings of Passive and Active Measurement Workshop (PAM-2003). 87-96.
Kim, Y-J., Govindan R., Karp B., & Shenker S. J. (2005).  On the Pitfalls of Geographic Face Routing. Proceedings of the DIALM-POMC Joint Workshop on Foundations of Mobile Computing. 34-43.

Pages