![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Shien-Ching Hwang
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2005
- [j7]Chien-Yu Chen, Shien-Ching Hwang, Yen-Jen Oyang:
Analysis and summarization of correlations in data cubes and its application in microarray data analysis. Intell. Data Anal. 9(1): 43-57 (2005) - [j6]Chien-Yu Chen
, Shien-Ching Hwang, Yen-Jen Oyang:
A statistics-based approach to control the quality of subclusters in incremental gravitational clustering. Pattern Recognit. 38(12): 2256-2269 (2005) - [j5]Yen-Jen Oyang, Shien-Ching Hwang, Yu-Yen Ou
, Chien-Yu Chen
, Zhi-Wei Chen:
Data classification with radial basis function networks based on a novel kernel density estimation algorithm. IEEE Trans. Neural Networks 16(1): 225-236 (2005) - 2003
- [c9]Yen-Jen Oyang, Darby Tien-Hao Chang, Chien-Yu Chen
, Shien-Ching Hwang:
Expediting protein structural analysis with an efficient kernel density estimation algorithm. ISMSE 2003: 297-304 - [c8]Yu-Yen Ou, Chien-Yu Chen, Shien-Ching Hwang, Yen-Jen Oyang:
Expediting model selection for Support Vector Machines based on data reduction. SMC 2003: 786-791 - 2002
- [c7]Chien-Yu Chen
, Shien-Ching Hwang, Yen-Jen Oyang:
Analysis and summarization of correlations in data cubes. Data Mining and Knowledge Discovery: Theory, Tools, and Technology 2002: 17-28 - [c6]Chien-Yu Chen, Shien-Ching Hwang, Yen-Jen Oyang:
An Incremental Hierarchical Data Clustering Algorithm Based on Gravity Theory. PAKDD 2002: 237-250 - 2001
- [j4]Shien-Ching Hwang, Gen-Huey Chen:
Minimum spanners of butterfly graphs. Networks 37(3): 156-164 (2001) - [j3]Gen-Huey Chen, Shien-Ching Hwang, Hui-Ling Huang, Ming-Yang Su, Dyi-Rong Duh:
A general broadcasting scheme for recursive networks with complete connection. Parallel Comput. 27(9): 1273-1278 (2001) - 2000
- [j2]Shien-Ching Hwang, Gen-Huey Chen:
Cycles in butterfly graphs. Networks 35(2): 161-171 (2000) - [c5]Shien-Ching Hwang, Gen-Huey Chen:
Fault-Free Hamiltonian Cycles in Faulty Butterfly Graphs. ICPADS 2000: 307-312 - [c4]Shien-Ching Hwang, Gen-Huey Chen:
The Minimum Spanner Problem on Butterfly Graphs. ISPAN 2000: 210-215
1990 – 1999
- 1999
- [j1]Shien-Ching Hwang, Gen-Huey Chen:
A note on cyclic-cubes. Inf. Process. Lett. 72(3-4): 131-135 (1999) - [c3]Shien-Ching Hwang, Gen-Huey Chen:
Shortest Paths of Butterfly Graphs. PDPTA 1999: 2195-2199 - 1998
- [c2]Gen-Huey Chen, Shien-Ching Hwang, Ming-Yang Su, Dyi-Rong Duh:
A General Broadcasting Scheme for Recursive Networks with Complete Connection. ICPADS 1998: 248- - [c1]Shien-Ching Hwang, Gen-Huey Chen:
Two Problems on Butterfly Graphs. ICPADS 1998: 572-579
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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:06 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint