Publications

Found 315 results
Author Title [ Type(Asc)] Year
Filters: First Letter Of Title is A  [Clear All Filters]
Web Article
Weaver, N. (2020).  Apple vs FBI: Pensacola Isn’t San Bernardino. Lawfare.
Thesis
Lei, H. (2007).  Applications of Keyword-Constraining in Speaker Recognition.
Sinha, S. (2008).  Answering Questions about Complex Events.
Technical Report
Pucci, G., & Zimmermann W. (1991).  On the Average Case Complexity of Parallel Sublist Selection.
Alberts, D., & Henzinger M. Rauch (1995).  Average Case Analysis of Dynamic Graph Algorithms.
Albers, S., & Mitzenmacher M. (1995).  Average Case Analyses of List Update Algorithms, with Applications to Data Compression.
Zimmermann, W. (1990).  Automatic Worst Case Complexity Analysis of Parallel Programs.
Zimmermann, W. (1991).  The Automatic Worst Case Analysis of Parallel Programs: Single Parallel Sorting and Algorithms on Graphs.
Gildea, D., & Jurafsky D. (2001).  Automatic Labeling of Semantic Roles.
Gildea, D., & Jurafsky D. (1994).  Automatic Induction of Finite State Transducers for Simple Phonological Rules.
Silipo, R., & Greenberg S. (2000).  Automatic Detection of Prosodic Stress in American English Discourse.
Philippsen, M. (1994).  Automatic Alignment of Array Data and Processes To Reduce Communication Time on DMPPs.
Cooke, M. P., & Ellis D. P. W. (1998).  The Auditory Organization of Speech in Listeners and Machines.
Herrtwich, R. Guido (1990).  Audio and Video in Distributed Computer Systems: Why and How?.
Gibbons, P. B. (1989).  The Asynchronous PRAM: A Semi-Synchronous Model for Shared Memory MIMD Machines (Thesis).
Sander, T. (1996).  Aspects of Algebraic Geometry over Non Algebraically Closed Fields.
Cristóbal, M. (2001).  Arriving Events in English and Spanish: A Contrastive Analysis in Terms of Frame Semantics.
Rejaie, R., Handley M., & Estrin D. (1998).  Architectural Considerations for Playback of Quality Adaptive Video over the Internet.
M. Shokrollahi, A., & Stemann V. (1996).  Approximation of Complex Numbers by Cyclotomic Integers.
Karpinski, M., & Wirtgen J. (1997).  On Approximation Hardness of the Bandwidth Problem.
Grigoriev, D. Yu., & Karpinski M. (1991).  An Approximation Algorithm for the Number of Zeros of Arbitrary Polynomials over GF[q].
Karpinski, M., Wirtgen J., & Zelikovsky A. (1997).  An Approximation Algorithm for the Bandwidth Problem on Dense Graphs.
Dagum, P., & Luby M. (1989).  Approximating the Permanent of Graphs with Large Factors.
Karpinski, M., & Luby M. (1990).  Approximating the Number of Solutions of a GF[2] Polynomial.
Henzinger, M. Rauch (1994).  Approximating Minimum Cuts Under Insertion.

Pages