Publications

Found 4258 results
Author Title [ Type(Asc)] Year
Technical Report
Banerjea, A., Parris C. J., & Ferrari D. (1993).  Recovering Guaranteed Performance Service Connections from Single and Multiple Faults.
Chrobak, M., & Dürr C. (1998).  Reconstructing Polyatomic Structures from Discrete X-Rays: NP-Completeness Proof for Three Atoms.
Chrobak, M., & Dürr C. (1998).  Reconstructing Hv-Convex Polyominoes from Orthogonal Projections.
Neubauer, C. (1996).  Recognition of Handwritten Digits and Human Faces by Convolutional Neural Networks.
Kingsbury, B., Irissou B., Asanović K., Wawrzynek J., & Morgan N. (1991).  Recent Work in VLSI Elements for Digital Implementations of Artificial Neural Networks.
Traub, J. F., & Wozniakowski H. (1993).  Recent Progress in Information-Based Complexity.
Ohlbach, H. Yürgen, & Koehler J. (1996).  Reasoning about Sets via Atomic Decomposition.
Umemura, K.., & Okazaki A.. (1991).  Real-Time Transmission and Software Decompression of Digital Video in a Workstation.
Ferrari, D. (1989).  Real-Time Communication in Packet-Switching Wide-Area Networks.
Ferrari, D. (1992).  Real-Time Communication in an Internetwork.
Bshouty, N. H., Hancock T. R., Hellerstein L., & Karpinski M. (1992).  Read-Once Threshold Formulas, Justifying Assignments, and Generic Tranformations.
Battiti, R.., & Protasi M. (1995).  Reactive Local Search for the Maximum Clique Problem.
Owens, T., Saenko K., Chakrabarti A., Xiong Y., Zickler T., & Darrell T. (2011).  The Ratio Method for Multi-View Color Constancy.
Zhang, H., & Ferrari D. (1992).  Rate-Controlled Static Priority Queueing.
Hermansky, H., Morgan N., Bayya A., & Kohn P. (1991).  RASTA-PLP Speech Analysis.
Hermansky, H., Morgan N., Bayya A., & Kohn P. (1991).  RASTA-PLP Speech Analysis.
Shastri, L. (1997).  Rapid Learning of Binding-Match and Binding-Error Detector Circuits via Long-Term Potentiation.
Blömer, J., Karp R. M., & Welzl E. (1996).  The Rank of Sparse Random Matrices Over Finite Fields.
Ratnasamy, S., Hellerstein J. M., & Shenker S. J. (2003).  Range Queries Over DHTs.
Karpinski, M., & Verbeek R. (1992).  On Randomized Versus Deterministic Computation.
Grigoriev, D. Yu., & Karpinski M. (1996).  Randomized ?(n^2) Lower Bound for Knapsack.
Gasieniec, L., Karpinski M., Plandowski W., & Rytter W. (1996).  Randomized Efficient Algorithms for Compressed Strings: the Finger-Print Approach.
Bürgisser, P., Karpinski M., & Lickteig T. Michael (1992).  On Randomized Algebraic Test Complexity.
Hernek, D. (1995).  Random Walks on Colored Graphs: Analysis and Applications.
Thielscher, M. (1996).  Ramification and Causality.

Pages