Publications

Found 289 results
Author [ Title(Desc)] Type Year
Filters: First Letter Of Title is P  [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
Zhang, N., Farrell R., & Darrell T. (2012).  Pose Pooling Kernels for Sub-Category Recognition. 3665-3672.
Hamann, C. M., & Chtcherbanski L. (1997).  Positional Logic Algebra - PLA - A Fascinating Alternative Approach.
Ladkin, P. (1989).  The Possibility of an Executable Specification Language.
Weaver, N., Markovskiy Y., Patel Y., & Wawrzynek J. (2003).  Post Placement C-Slow Retiming for the Xilinx Virtex FPGA.
Mehta, A., Shenker S., & Vazirani V. V. (2006).  Posted Price Profit Maximization for Multicast by Approximating Fixed Points. Journal of Algorithms. 58(2), 150-164.
Sargent, M., Kristoff J., Paxson V., & Allman M. (2017).  On the Potential Abuse of IGMP. ACM Computer Communication Review. 47(1), 
Felegyhazi, M., Kreibich C., & Paxson V. (2010).  On the Potential of Proactive Domain Blacklisting.
Kurfess, F. (1991).  Potentiality of Parallelism in Logic.
Perfors, A., Tenenbaum J., & Regier T. (2006).  Poverty of the Stimulus? A Rational Approach. Proceedings of the 28th Annual Conference of the Cognitive Science Society (CogSci 2006).
Sargent, M., Czyz J., Allman M., & Bailey M. (2015).  On The Power and Limitations of Detecting Network Filtering via Passive Observation. Proceedings of the Passive and Active Management Conference (PAM 2015).
Baumbach, J. (2010).  On the Power and Limits of Evolutionary Conservation -- Unraveling Bacterial Gene Regulatory Networks. Nucleic Acids Research. 38(22), 7877-7884.
Aberer, K., & Codenotti B. (1992).  On the Power of Discontinous Approximate Computations.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the Power of Randomization in Online Algorithms.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1994).  On the power of randomization in on-line algorithms. Algorithmica. 11(1), 2-14.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the power of randomization in online algorithms. Proceedings of the 22nd Annual ACM Symposium on Theory of Computing. 379-386.
Ablayev, F., & Karpinski M. (1995).  On the Power of Randomized Branching Programs.
Kramer, O., Satzger B., & Lässig J. (2010).  Power Prediction in Smart Grids with Evolutionary Local Kernel Regression. 262-269.
Zhang, W., Yu S. X., & Teng S-H. (2012).  Power SVM: Generalization with Exemplar Classification Uncertainty. 2144-2151.
Saenko, K., Karayev S., Jia Y., Shyr A., Janoch A., Long J., et al. (2011).  Practical 3-D Object Detection Using Category and Instance-Level Appearance Models. 793-800.
Kim, Y.., Govindan R., Karp B., & Shenker S. (2004).  Practical and Robust Geographic Routing in Wireless Networks.
Al-Dalky, R., Rabinovich M., & Allman M. (2018).  Practical Challenge-Response for DNS. ACM Computer Communication Review. 48(3), 
Paxson, V., Christodorescu M., Javed M., Rao J., Sailer R., Schales D., et al. (2013).  Practical Comprehensive Bounds on Surreptitious Communication over DNS.
Pietzowski, A., Satzger B., Trumler W.., & Ungerer T. (2010).  A Practical Computer Immunology Approach for Self-Protection Enhanced by Optimization Techniques.
Ee, C. Tien, Ratnasamy S., & Shenker S. (2006).  Practical Data-Centric Storage. Proceedings of the Third Symposium on Networked Systems Design and Implementation (NSDI 2006). 325-338.
Hinrichs, T. L., Gude N. S., Casado M., Mitchell J. C., & Shenker S. (2009).  Practical Declarative Network Management. 1-10.

Pages