| 國立交通大學 |
2014-12-08T15:38:25Z |
Deterministic Extractors for Independent-Symbol Sources
|
Lee, Chia-Jung; Lu, Chi-Jen; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:36:53Z |
Online Prediction Problems with Variation
|
Lee, Chia-Jung; Tsai, Shi-Chun; Yang, Ming-Chuan |
| 國立交通大學 |
2014-12-08T15:36:41Z |
Network security management with traffic pattern clustering
|
Chiou, Tao-Wei; Tsai, Shi-Chun; Lin, Yi-Bing |
| 國立交通大學 |
2014-12-08T15:33:54Z |
More on the one-dimensional sliding-coin puzzle
|
Lin, Ting-Yu; Tsai, Shi-Chun; Tsai, Wen-Nung; Tsay, Jong-Chuang |
| 國立交通大學 |
2014-12-08T15:28:12Z |
Inapproximability Results for the Weight Problems of Subgroup Permutation Codes
|
Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:26:47Z |
Decoding permutation arrays with ternary vectors
|
Lee, Chia-Jung; Lin, Te-Tsung; Shieh, Min-Zheng; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立交通大學 |
2014-12-08T15:24:09Z |
On the inapproximability of maximum intersection problems
|
Shieh, Min-Zheng; Tsai, Shi-Chun; Yang, Ming-Chuan |
| 國立交通大學 |
2014-12-08T15:22:32Z |
Computing the ball size of frequency permutations under Chebyshev distance
|
Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:22:22Z |
Extracting Computational Entropy and Learning Noisy Linear Functions
|
Lee, Chia-Jung; Lu, Chi-Jen; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:21:28Z |
Decoding Frequency Permutation Arrays under Infinite norm
|
Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:21:21Z |
Computing the Ball Size of Frequency Permutations under Chebyshev Distance
|
Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:20:49Z |
Extracting Computational Entropy and Learning Noisy Linear Functions
|
Lee, Chia-Jung; Lu, Chi-Jen; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:17:49Z |
Deterministic extractors for independent-symbol sources
|
Lee, Chia-Jung; Lu, Chi-Jen; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:16:07Z |
On the construction of permutation arrays via mappings from binary vectors to permutations
|
Huang, Yen-Ying; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立交通大學 |
2014-12-08T15:14:42Z |
Improved hardness amplification in NP
|
Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立交通大學 |
2014-12-08T15:13:48Z |
Arranging numbers on circles to reach maximum total variations
|
Liao, Ying-Jie; Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:13:15Z |
On the fairness and complexity of generalized k-in-a-row games
|
Hsieh, Ming Yu; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:13:03Z |
Efficient large-scale distributed key generation against burst interruption
|
Ou, Jheng-Ru; Tsai, Shi-Chun; Tzeng, Wen-Guey |
| 國立交通大學 |
2014-12-08T15:12:10Z |
Jug measuring: Algorithms and complexity
|
Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:12:09Z |
More on the Magnus-Derek game
|
Chen, Li-Jui; Lin, Jinn-Jy; Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:12:05Z |
An Optimal Data Hiding Scheme With Tree-Based Parity Check
|
Hou, Chung-Li; Lu, ChangChun; Tsai, Shi-Chun; Tzeng, Wen-Guey |
| 國立交通大學 |
2014-12-08T15:11:57Z |
Complexity of Hard-Core Set Proofs
|
Lu, Chi-Jen; Tsai, Shi-Chun; Wu, Hsin-Lung |
| 國立交通大學 |
2014-12-08T15:11:36Z |
Alternating Runs of Geometrically Distributed Random Variables
|
Lee, Chia-Jung; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:11:36Z |
Improved Bound on Approximating Jug Measuring Problem
|
Shieh, Min-Zheng; Tsai, Shi-Chun |
| 國立交通大學 |
2014-12-08T15:09:56Z |
Key Establishment Schemes against Storage-Bounded Adversaries in Wireless Sensor Networks
|
Tsai, Shi-Chun; Tzeng, Wen-Guey; Zhou, Kun-Yi |
