Global ETD Search

141	Some asymptotic approximation theorems in real and complex analysis Liu, Ming-chit. January 1973 (has links) Thesis (Ph. D.)--University of Hong Kong, 1973. / Also available in print.
142	Algorithmic aspects of connectivity, allocation and design problems Chakrabarty, Deeparnab January 2008 (has links) Thesis (Ph.D.)--Computing, Georgia Institute of Technology, 2008. / Committee Chair: Vazirani, Vijay; Committee Member: Cook, William; Committee Member: Kalai, Adam; Committee Member: Tetali, Prasad; Committee Member: Thomas, Robin
143	Marcinkiewicz's theorem and its generalizations / Ko, Hong Fu. January 2004 (has links) Thesis (M. Phil.)--Hong Kong University of Science and Technology, 2004. / Includes bibliographical references (leaves 31). Also available in electronic version. Access restricted to campus users.
144	Approximation algorithms for NP-hard clustering problems Mettu, Ramgopal Reddy. January 2002 (has links) (PDF) Thesis (Ph. D.)--University of Texas at Austin, 2002. / Vita. Includes bibliographical references. Available also from UMI Company.
145	A projected Hamiltonian approach to polyatomic systems Smith, Jack A, January 1978 (has links) Thesis--University of Florida. / Description based on print version record. Typescript. Vita. Includes bibliographical references (leaves 111-114).
146	A modal/WKB inversion method for determining sound speed profiles in the ocean and ocean bottom Casey, Kevin D. January 1900 (has links) Thesis (Ocean Engineer and M.S.)--Massachusetts Institute of Technology, 1988. / Supervised by George V. Frisk. "June 1988." Funding provided through MIT by the Office of Naval Research Fellowship Program. Includes bibliographical references (p. 99-103).
147	Das Shor-Verfahren als stochastischer Algorithmus Kugel, Felix. January 2006 (has links) (PDF) München, Univ. der Bundeswehr, Diss., 2006.
148	Kettenbruchentwicklung in beliebiger Dimension, Stabilität und Approximation Rössner, Carsten. Unknown Date (has links) Universiẗat, Diss., 1996--Frankfurt (Main).
149	A Constant-Factor Approximation Algorithm for Embedding Unweighted Graphs into Trees Badoiu, Mihai, Indyk, Piotr, Sidiropoulos, Anastasios 05 July 2004 (has links) We present a constant-factor approximation algorithm for computing anembedding of the shortest path metric of an unweighted graph into atree, that minimizes the multiplicative distortion. AI embeddings approximation algorithms trees
150	Bancs de filtres itérés en fraction d'octave : application au codage de son / Blu, Thierry. January 1996 (has links) Th. doct.--Signal et images--Paris--ENST, 1996. / Bibliogr., 3 p. Résumé en français et en anglais. Contient des annexes en anglais.

Search results