Worst-case identification in l1 : algorithms and complexity
Thesis (M.S.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 1993.
Main Author: | Theodosopoulos, Theodore |
---|---|
Other Authors: | Munther A. Dahleh. |
Format: | Thesis |
Language: | eng |
Published: |
Massachusetts Institute of Technology
2005
|
Subjects: | |
Online Access: | http://hdl.handle.net/1721.1/12608 |
Similar Items
-
Stochastic models for global optimization
by: Theodosopoulos, Theodore
Published: (2005) -
Linear algebraic techniques in algorithms and complexity
by: Alman, Josh(Joshua H.)
Published: (2020) -
Tight Polynomial Worst-Case Bounds for Loop Programs
by: Amir M. Ben-Amram, et al.
Published: (2020-05-01) -
Decoding algorithms for complex natural language tasks
by: Deshpande, Pawan
Published: (2008) -
Applications of auction algorithms to complex problems with constraints
by: Dukellis, John N. (John Nicholas), 1977-
Published: (2005)