default search action
Ju Yuan Hsiao
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
- [c13]Ju Yuan Hsiao, Zhi-Yu Xu:
A Lossless Image Compression Method with the Reversible Data Embedding Capacity. SIGMAP 2009: 27-32 - 2005
- [c12]Chin-Chen Chang, Chi-Lung Chiang, Ju Yuan Hsiao:
A DCT-Domain System for Hiding Fractal Compressed Images. AINA 2005: 83-86 - 2004
- [c11]Ju Yuan Hsiao, Shu-Yi Chen:
High Probability Impulsive Noise Removal for Corrupted Images. ICDCS Workshops 2004: 190-194 - 2003
- [j7]Chin-Chen Chang, Ju Yuan Hsiao, Chi-Shiang Chan:
Finding optimal least-significant-bit substitution in image hiding by dynamic programming strategy. Pattern Recognit. 36(7): 1583-1595 (2003) - [c10]Chin-Chen Chang, Chi-Shiang Chan, Ju Yuan Hsiao:
Lossless Image Compression Based on Two-Way Smaller Difference. AINA 2003: 821-824 - 2002
- [c9]Chin-Chen Chang, Po-Wen Lu, Ju Yuan Hsiao:
A Hybrid Method for Estimating the Euclidean Distance between Two Vectors. CW 2002: 183-190 - [c8]Chin-Chen Chang, Ju Yuan Hsiao, Chi-Lung Chiang:
An Image Copyright Protection Scheme Based on Torus Automorphism. CW 2002: 217-224 - [c7]Ju Yuan Hsiao, Shu-Yi Chen:
A Two-Stage Switching-Based Median Filter. IEEE Pacific Rim Conference on Multimedia 2002: 377-385 - [c6]Chin-Chen Chang, Chih-Ping Hsieh, Ju Yuan Hsiao:
A Fast and Efficient Noise Reduction Method Suitable for Low Noise Density. IEEE Pacific Rim Conference on Multimedia 2002: 386-392 - [c5]Chin-Chen Chang, Ju Yuan Hsiao, Chi-Lung Chiang:
A Cross-Type Peak-and-Valley Filter for Error Prevention and Resilience in Image Communications. IEEE Pacific Rim Conference on Multimedia 2002: 393-400 - 2001
- [c4]Chin-Chen Chang, Jyh-Chiang Yeh, Ju Yuan Hsiao:
A Novel Scheme for Securing Image Steganography. IEEE Pacific Rim Conference on Multimedia 2001: 804-811 - [c3]Chin-Chen Chang, Chi-Shiang Chan, Ju Yuan Hsiao:
A Color Image Retrieval Method Based on Local Histogram. IEEE Pacific Rim Conference on Multimedia 2001: 831-836 - 2000
- [j6]Jywe-Fei Fang, Ju Yuan Hsiao, Chuan Yi Tang:
Embedding cycles and meshes onto incomplete hypercubes. Int. J. Comput. Math. 75(1): 1-19 (2000) - [c2]Chin-Chen Chang, Jyh-Chiang Yeh, Ju Yuan Hsiao:
A Method for Protecting Digital Images from Being Copied Illegally. Kyoto International Conference on Digital Libraries 2000: 348-355
1990 – 1999
- 1999
- [j5]Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee:
An Optimal Embedding of Cycles into Incomplete Hypercubes. Inf. Process. Lett. 72(5-6): 213-218 (1999) - [c1]Chien-Hung Huang, Ju Yuan Hsiao, Richard C. T. Lee, Jywe-Fei Fang:
An Optimal Embedding of Incomplete Binary Trees onto Incomplete Hypercubes. ISPAN 1999: 80-87 - 1994
- [j4]Ju Yuan Hsiao, Chuan Yi Tang, Ruay Shiung Chang, Richard C. T. Lee:
Single Step Searching in Weighted Block Graphs. Inf. Sci. 81(1-2): 1-29 (1994) - 1993
- [j3]Ju Yuan Hsiao, Chuan Yi Tang, Ruay Shiung Chang:
The summation and bottleneck minimization for single-step searching on weighted graphs. Inf. Sci. 74(1-2): 1-28 (1993) - 1992
- [j2]Ju Yuan Hsiao, Chuan Yi Tang, Ruay Shiung Chang:
An Efficient Algorithm for Finding a Maximum Weight 2-Independent Set on Interval Graphs. Inf. Process. Lett. 43(5): 229-235 (1992) - 1991
- [j1]Ju Yuan Hsiao, Chuan Yi Tang, Ruay Shiung Chang:
Solving the Single Step Graph Searching Problem by Solving the Maximum Two-Independent Set Problem. Inf. Process. Lett. 40(5): 283-287 (1991)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint