公開日期 | 標題 | 作者 | 來源出版物 | scopus | WOS | 全文 |
1997 | On the chow ring of a flag | Wenzel, C.; CHRISTIAN HELMUT WENZEL | Mathematische Nachrichten | 0 | 0 | |
1980 | On the Closed-Loop PWM Inverter Systems | Hsu, Yuan-Yih | | | | |
2012 | On the coexistence of localization and semiclassical transport in the low-field quantum Hall effect | CHI-TE LIANG ; Hang, D.R.; Lin, L.-H.; Huang, C.F.; YUAN-HUEI CHANG ; Huang, C.-Y.; Chen, J.C.; Tang, C.-C.; Chen, S.-F.; Lin, Y.-C.; Liu, C.-H.; Cheng, K.A. | Physica E: Low-Dimensional Systems and Nanostructures | 3 | 3 | |
1989 | On the Coherent Interference Suppression Using a Spatially Smoothing Adaptive Array | Yeh, C.-C.; Chiu, S.-C.; Pei, S.-C.; SOO-CHANG PEI | IEEE Transactions on Antennas and Propagation | 11 | 9 | |
1992 | On the Collision Efficiency in Polymer Flocculation of Colloidal Particles | 徐治平 ; Lin, D. P.; Hsu, Jyh-Ping | Colloid and Polymer Science | 4 | 3 | |
1992 | On the Collision Efficiency of Polymer-Induced Flocculation | 徐治平 ; Lin, D. P.; Hsu, Jyh-Ping | Journal of Ciche | | | |
2013 | On the compensation of LQG over a lossy network utilizing previous control signals | Yu, J.-T.; Fu, L.-C.; LI-CHEN FU | American Control Conference | | | |
1986 | On The Complexity of Deciding Fair Termination of Probabilistic Concurrent Finite-State Programs. | Rosier, Louis E.; HSU-CHUN YEN | Automata, Languages and Programming, 13th International Colloquium, ICALP86, Rennes, France, July 15-19, 1986, Proceedings | | | |
1988 | On the Complexity of Deciding fair Termination of Probabilistic Concurrent Finite-State Programs. | Rosier, Louis E.; HSU-CHUN YEN | Theor. Comput. Sci. | | | |
1996 | On the Complexity of Distributed Query Optimization | Wang, Chihping; Chen, Ming-Syan | IEEE Transactions on Knowledge and Data Engineering | 39 | 31 | |
1992 | On the complexity of generating synchronizable test sequences. | Liu, Lung-Tien; Chen, Gen-Huey; Lu, Ching-Sung | J. Complexity | 0 | 0 | |
1990 | On the Complexity of Generating the Test Sequence Without Synchronization Problem | Liu, L. T.; 陳健輝 ; Lu, C. S.; Chen, Gen-Huey | 1990 International Comuter Symposium | | | |
2015 | On the complexity of higher order abstract Voronoi diagrams | CHIH-HUNG LIU ; Bohler C; Cheilaris P; Klein R; Liu C.-H; Papadopoulou E; Zavershynskyi M.; CHIH-HUNG LIU | Computational Geometry: Theory and Applications | | | |
2013 | On the complexity of higher order abstract Voronoi diagrams | CHIH-HUNG LIU ; Bohler C; Cheilaris P; Klein R; Liu C.-H; Papadopoulou E; Zavershynskyi M.; CHIH-HUNG LIU | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | | | |
2012 | On the complexity of query answering over incomplete XML documents. | Gheerbrant, Am?lie; Libkin, Leonid; Tan, Tony; TONY TAN | 15th International Conference on Database Theory, ICDT '12, Berlin, Germany, March 26-29, 2012 | 16 | 0 | |
1992 | On the complexity of search algorithms | Chung, Kuo-Liang; Chen, Wen-Chin ; Lin, Ferng-Ching | IEEE Transactions on Computers | | | |
1992 | On the Complexity of Search Algorithms. | Chung, Kuo-Liang; Chen, Wen-Chin; Lin, Ferng-Ching; WEN-CHIN CHEN | IEEE Trans. Computers | 4 | 2 | |
2019 | On the Complexity of Self-assembly Tasks | CHEN HO-LIN | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | | | |
1998 | On the Complexity of the k-Chain Subgraph Cover Problem. | Yu, Chang-Wu; GEN-HUEY CHEN ; Ma, Tze-Heng | Theor. Comput. Sci. | 12 | 10 | |
2003 | On the Complexity of the Ritchken Sankarasubramanian Interest Rate Model | Chien, Hsin-Huan | | | | |