Jan shih (8 risultati)
- Brossura
Da: Revaluation Books, Exeter, Regno UnitoRevaluation Books
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 41,96
EUR 11,68 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Paperback. Condizione: Brand New. 52 pages. 8.66x5.91x0.12 inches. In Stock.
- Brossura
Da: preigu, Osnabrück, Germaniapreigu
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 19,90
EUR 70,00 spedizioneSpedito da Germania a U.S.A.Quantità: 5 disponibili
Taschenbuch. Condizione: Neu. Automatic Enumeration of Intervals of Partial Co- Clones | Jan Shih | Taschenbuch | 52 S. | Englisch | 2016 | LAP LAMBERT Academic Publishing | EAN 9783659929991 | Verantwortliche Person für die EU: preigu GmbH & Co. KG, Lengericher Landstr. 19, 49078 Osnabrück, mail[at]preigu[dot]de | Anbieter: pre…igu.
Altre immaginiEditore: Holbein Publishing Company, Basle, 1946
- Brossura
- Prima edizione
Da: Douglas Books, Tunbridge Wells, Regno UnitoDouglas Books
Contatta il venditoreVenditore con 4 stelleCondizione: Usato - Molto buono
EUR 72,15
EUR 25,69 spedizioneSpedito da Regno Unito a U.S.A.Quantità: 1 disponibili
Soft cover. Condizione: Very Good. No Jacket. 1st Edition. Thin blue card covers with Chinese calligraphic panel to top section of fore-edge, no spine but secured by 4 brown string bow ties, front cover faded. In gray card slip-case with col.ill. to front, clean but bottom corner chipped. All fore-edges unopened leaving internal… pages blank, hence pagination on 1st and 4th pp. of each gathering. 18 pp.+ 16 coloured plates, 7-16 by Ch'i Pai-shih, the others comprise 2 each by Ch'en Shi-tseng and Chang Ta'chien plus 2 'imperfectly signed' . Two blue endpapers front and rear, 4 white endpapers {i.e. 2 unopened gatherings) to front, 2 to rear. Light tanning to outer edges throughout, otherwise clean, tight and unmarked. Ch'i Pai-shih, Chen Shi-tseng, Chang Ta'chien (illustratore).
IMAGES OF THE MIND: Selections from the Edward L. Elliott Family and John B. Elliott Collections of Chinese Calligraphy and Painting At the Art Museum, Princeton University
Fong, Wen C., Alfreda Murck, Shou-chien Shih, Pao-chen Ch'en, Jan Stuart
Editore: The Art Museum, Princeton University Princeton 1984. (first pbk. ed.), 1984
- Rilegato
Da: Pali, Roma, RM, ItaliaPali
Contatta il venditoreVenditore con 3 stelleCondizione: Usato - Come nuovo
EUR 110,00
EUR 32,00 spedizioneSpedito da Italia a U.S.A.Quantità: 1 disponibili
Softcover. Condizione: As New. folio in color-illustrated wraps, with orange text on predominantly green spine. With black & white and full-color illustrations. 504 pp. selections from the Edward L. Elliott Family and John B. Elliot Collections of Chinese Calligraphy and Paintings at The Art Museum , Princeton University. please… inquire on shipping for international orders. Catalogue of an exhibition held April 15-June 17, 1984. Bibliography: p. 491-493. Subjects Elliott family - Exhibitions. | Princeton University. - Art Museum - Exhibitions. | Art, Chinese - Sung-Yuan dynasties, 960-1368 - Exhibitions. | Art, Chinese - Ming-Ch'ing dynasties, 1368-1912 - Exhibitions . | Landscape in art - Exhibitions. | Art - Private collections - New Jersey - Princeton - Exhibitions. Other authors/contributors Fong, Wen | Princeton University. Art Museum.
- Brossura
- Print on Demand
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, GermaniaBuchWeltWeit Ludwig Meier e.K.
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 21,90
EUR 23,00 spedizioneSpedito da Germania a U.S.A.Quantità: 2 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book provide an efficient way to find intervals between partial co-clones through supercomputer. It utilizes computer hardware characteristics, and Prune and search algorithm to search problem size up to O(2 to the power of 80…). This algorithm uses little memory with linear complexity, and almost no communication between computing nodes. It is a fast, light-weighted tool for researchers who has many relatively small partial clone related problems. 52 pp. Englisch.
- Brossura
- Print on Demand
Da: moluna, Greven, Germaniamoluna
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 20,83
EUR 48,99 spedizioneSpedito da Germania a U.S.A.Quantità: Più di 20 disponibili
Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Shih JanI used to work in Logos Lab led by professor Ren-Song Tsay in my Bachelor years in NTHU in Taiwan. I completed my master degree in TCSLab in Linkoping university in Sweden. My supervisor was Do…ctor Victor Lagerkvist.This .
- Brossura
- Print on Demand
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germaniabuchversandmimpf2000
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 21,90
EUR 60,00 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book provide an efficient way to find intervals between partial co-clones through supercomputer. It utilizes computer hardware characteristics, and Prune and search algorithm to search problem size up to O(2 to the power of 80). T…his algorithm uses little memory with linear complexity, and almost no communication between computing nodes. It is a fast, light-weighted tool for researchers who has many relatively small partial clone related problems.VDM Verlag, Dudweiler Landstraße 99, 66123 Saarbrücken 52 pp. Englisch.
- Brossura
- Print on Demand
Da: AHA-BUCH GmbH, Einbeck, GermaniaAHA-BUCH GmbH
Contatta il venditoreVenditore con 5 stelleCondizione: Nuovo
EUR 24,27
EUR 60,48 spedizioneSpedito da Germania a U.S.A.Quantità: 1 disponibili
Taschenbuch. Condizione: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This book provide an efficient way to find intervals between partial co-clones through supercomputer. It utilizes computer hardware characteristics, and Prune and search algorithm to search problem size up to O(2 to the power of 80). Th…is algorithm uses little memory with linear complexity, and almost no communication between computing nodes. It is a fast, light-weighted tool for researchers who has many relatively small partial clone related problems.
