Publications

Found 296 results
[ Author(Asc)] Title 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 
K
Kramer, O., Satzger B., & Lässig J. (2010).  Power Prediction in Smart Grids with Evolutionary Local Kernel Regression. 262-269.
Kohli, P., Osokin A., & Jegelka S. (2013).  A Principled Deep Random Field for Image Segmentation. 1971-1978.
Kohler, E., Morris R., & Chen B. (2002).  Programming Language Optimizations for Modular Router Configurations. Proceedings of the Tenth International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS-X).
Kohler, E. (1997).  Prolac: a language for protocol compilation.
Kohler, E., Chen B., M. Kaashoek F., Morris R., & Poletto M. (2000).  Programming Language Techniques for Modular Router Configurations.
Klas, W., & Turau V. (1992).  Persistence in the Object-Oriented Database Programming Language VML.
Kitzelmann, E., & Schmid U. (2011).  Proceedings of AAIP 2011.
Kirkpatrick, B., Li S. Cheng, Karp R. M., & Halperin E. (2011).  Pedigree Reconstruction Using Identity by Descent. Journal of Computational Biology. 18(11), 1481-1493.
Kirkpatrick, B., Li S. Cheng, Karp R. M., & Halperin E. (2011).  Pedigree Reconstruction Using Identity by Descent. 136-152.
Kingsbury, B. (1998).  Perceptually-Inspired Signal Processing Strategies for Robust Speech Recognition in Reverberant Environments.
Kim, Y.., Govindan R., Karp B., & Shenker S. J. (2004).  Practical and Robust Geographic Routing in Wireless Networks.
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.
Keshav, S. (1991).  The Packet Pair Flow Control Protocol.
Kennedy, L.., & Ellis D. P. W. (2003).  Pitch-Based Emphasis Detection for Characterization of Meeting Recordings. Proceedings of the IEEE Workshop on Automatic Speech Recognition and Understanding (ASRU 2003).
Kemke, C. (1994).  Parsing Neural Networks Combining Symbolic and Connectionist Approaches.
Kelley, B. P., Yuan B., Lewitter F., Sharan R., Stockwell B. R., & Ideker T. E. (2004).  PathBLAST: A Tool for Alignment of Protein Interaction Networks. 32, W83-W88.
Kay, P. (2004).  Pragmatic Aspects of Grammatical Constructions.
Karpinski, M. (1997).  Polynomial Time Approximation Schemes for Some Dense Instances of NP-Hard Optimization Problems.
Karpinski, M., & Macintyre A. (1995).  Polynomial Bounds for VC Dimension of Sigmoidal Neural Networks.
Karpinski, M., & Zimmermann W. (1991).  Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms.
Karpinski, M., Dahlhaus E., & Lingas A. (1989).  A Parallel Algorithm for Maximum Matching in Planar Graphs.
Karp, R. M., & Zhang Y. (1989).  On parallel evaluation of game trees. Proceedings of the 1989 ACM Symposium on Parallel Algorithms and Architectures (SPAA '89). 409-420.
Karp, R. M. (1991).  Parallel Combinatorial Computing.
Karp, R. M., & Orlin J.. B. (1981).  Parametric Shortest Path Algorithms with an Application to Cyclic Staffing. Discrete Applied Mathematics (Netherlands). 3(1), 37-45.
Karp, R. M., & Matula D. W. (1975).  Probabilistic Behavior of a Naive Coloring Algorithm on Random Graphs. Bulletin of the Operations Research Society of America. 23,

Pages