Publications

Found 289 results
Author Title [ Type(Asc)] Year
Filters: First Letter Of Title is P  [Clear All Filters]
Technical Report
Ladkin, P., & Vogt F. (1990).  Proceedings of the Berkeley Workshop on Temporal and Real-Time Specification, August 9-10, 1990.
Voelkel, L. (1995).  On the Problem of Masking Special Errors by Signature Analyzers.
Renals, S., Morgan N., & Bourlard H. (1991).  Probability Estimation by Feed-Forward Networks in Continuous Speech Recognition.
Karpinski, M., & Zimmermann W. (1991).  Probabilistic Recurrence Relations for Parallel Divide-and-Conquer Algorithms.
Karp, R. M. (1991).  Probabilistic Recurrence Relations.
Albanese, A., Blömer J., Edmonds J., & Luby M. (1994).  Priority Encoding Transmission.
Regier, T. (1994).  A Preliminary Study of the Semantics of Reduplication.
Frederickson, G. N., & Guan D.. J. (1989).  Preemptive Ensemble Motion Planning on a Tree.
Stolcke, A., & Segal J. (1994).  Precise n-gram Probabilities from Stochastic Context-free Grammars.
Reischuk, R. (1993).  Precise Average Case Complexity Measures.
Ablayev, F., & Karpinski M. (1995).  On the Power of Randomized Branching Programs.
Ben-David, S., Borodin A., Karp R. M., Tardos G., & Wigderson A. (1990).  On the Power of Randomization in Online Algorithms.
Aberer, K., & Codenotti B. (1992).  On the Power of Discontinous Approximate Computations.
Kurfess, F. (1991).  Potentiality of Parallelism in Logic.
Ladkin, P. (1989).  The Possibility of an Executable Specification Language.
Hamann, C. M., & Chtcherbanski L. (1997).  Positional Logic Algebra - PLA - A Fascinating Alternative Approach.
Stoutamire, D. (1997).  Portable, Modular Expression of Locality.
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.
Maresca, M. (1991).  Polymorphic Processor Arrays.
Kutylowski, M., & Wanka R. (1997).  Playing Tetris on Meshes and Multi-Dimensional Shearsort.
De Micheli, E., & Verri A. (1992).  Planar Passive Navigation: One Dimension Is Better Than Two.

Pages