default search action
Wanming Chu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [c61]Yamin Li, Wanming Chu:
Fault Tolerance and Packet Latency of Peer Fat-Trees. PDCAT 2022: 413-425 - [c60]Wanming Chu, Shun Yanaka, Yuta Watanabe, Yoshino Tomoaki:
Interactive Bus Route Search System on Query-by-Object with Open Data. SoMeT 2022: 18-29 - 2021
- [j15]Shashank Shrestha
, Manoj Poudel, Rashmi P. Sarode, Wanming Chu, Subhash Bhalla
Open data integration model using a polystore system for large scale scientific data archives in astronomy. Int. J. Comput. Sci. Eng. 24(2): 116-127 (2021) - [c59]Yamin Li, Wanming Chu:
Shift-Sub Modular Multiplication Algorithm and Hardware Implementation for RSA Cryptography. HIS 2021: 541-552 - 2020
- [j14]Yamin Li
Mirrored K-Ary N-Tree and its efficiency of fault tolerance. Int. J. Commun. Syst. 33(17) (2020)
2010 – 2019
- 2019
- [c58]Rashmi P. Sarode
Segment-Search vs Knowledge Graphs: Making a Key-Word Search Engine for Web Documents. BDA 2019: 88-107 - [c57]Yamin Li, Wanming Chu:
Switch Fault Tolerance in a Mirrored K-Ary N-Tree. CITS 2019: 1-5 - [c56]Shelly Sachdeva
Relational-like Query Language for Archetypes in Standardized Electronic Health Records Databases. COMAD/CODS 2019: 272-275 - [c55]Manoj Poudel, Rashmi P. Sarode
Development of a Polystore Data Management System for an Evolving Big Scientific Data Archive. Poly/DMAH@VLDB 2019: 167-182 - 2018
- [j13]Wanming Chu:
Smart city workflow patterns for qualitative aggregate information retrieval from distributed public information resources. Int. J. Comput. Sci. Eng. 16(4): 401-410 (2018) - [c54]Yamin Li, Wanming Chu:
MiKANT: A Mirrored K-Ary N-Tree for Reducing Hardware Cost and Packet Latency of Fat-Tree and Clos Networks. SmartWorld/SCALCOM/UIC/ATC/CBDCom/IOP/SCI 2018: 1643-1650 - [c53]Shashank Shrestha
PDSPTF: Polystore Database System for Scalability and Access to PTF Time-Domain Astronomy Data Archives. Poly/DMAH@VLDB 2018: 78-92 - 2017
- [c52]Yamin Li, Wanming Chu:
KMS-Cube - A general alternative to hypercubes for reducing the node degree. CITS 2017: 316-320 - [c51]Shashank Shrestha
Workflow Based Query Management System for Astronomical Data Repository. SoMeT 2017: 719-730 - 2016
- [c50]Yamin Li, Wanming Chu:
On the improved implementations and performance evaluation of digit-by-digit integer restoring and non-restoring cube root algorithms. CITS 2016: 1-5 - [c49]Yamin Li, Wanming Chu:
Adjusting Parameters of k-Ary n-Cube to Achieve Better Cost Performance. Trustcom/BigDataSE/ISPA 2016: 1218-1225 - 2015
- [j12]Aastha Madaan, Wanming Chu:
In-depth querying of web-based medical documents: beyond single page results. Int. J. Comput. Sci. Eng. 11(3): 284-296 (2015) - [c48]Yilang Wu, Wanming Chu:
Query Languages for Domain Specific Information from PTF Astronomical Repository. DNIS 2015: 237-243 - [e1]Wanming Chu, Shinji Kikuchi, Subhash Bhalla
Databases in Networked Information Systems - 10th International Workshop, DNIS 2015, Aizu-Wakamatsu, Japan, March 23-25, 2015. Proceedings. Lecture Notes in Computer Science 8999, Springer 2015, ISBN 978-3-319-16312-3 [contents] - 2014
- [j11]Yamin Li, Wanming Chu:
Total exchange routing on hierarchical dual-nets. Int. J. Big Data Intell. 1(4): 230-243 (2014) - [c47]Hikaru Suzuki, Eri Suzuki, Wanming Chu, Junya Terazono, Subhash Bhalla:
Exploring Kaguya Moon Mission Sensor Data by Locating Geographic Entities. BDA 2014: 169-173 - [c46]Aastha Madaan, Wanming Chu:
Handling Domain Specific Document Repositories for Application of Query Languages. DNIS 2014: 152-167 - [c45]Hiroki Nakamura, Subhash Bhalla
Kaguya Moon Mission Data Repository: New Query Language Interface for Locating GIS Objects. DNIS 2014: 232-255 - [c44]Wanming Chu:
Search System for City Information Using Multiple Public Transportation Information Resources. DNIS 2014: 256-265 - 2013
- [c43]Aastha Madaan, Wanming Chu, Daigo Yaginuma, Subhash Bhalla
Quasi-Relational Query Language Interface for Persistent Standardized EHRs: Using NoSQL Databases. DNIS 2013: 182-196 - [c42]Yamin Li, Wanming Chu:
Total Exchange Routing on Hierarchical Dual-Nets. NPC 2013: 179-193 - 2012
- [j10]Shelly Sachdeva
AQBE - QBE Style Queries for Archetyped Data. IEICE Trans. Inf. Syst. 95-D(3): 861-871 (2012) - [j9]Shelly Sachdeva
Information interchange services for electronic health record databases. Int. J. Comput. Sci. Eng. 7(1): 38-51 (2012) - [j8]Yamin Li, Shietung Peng, Wanming Chu:
Hierarchical Dual-Net: A Flexible Interconnection Network and its Routing Algorithm. Int. J. Netw. Comput. 2(2): 234-250 (2012) - 2011
- [j7]Yamin Li, Shietung Peng, Wanming Chu:
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. Int. J. Found. Comput. Sci. 22(5): 1001-1018 (2011) - [j6]Yamin Li, Shietung Peng, Wanming Chu:
Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net. Int. J. Netw. Comput. 1(2): 178-190 (2011) - [j5]Yamin Li, Shietung Peng, Wanming Chu:
Parallel Prefix Computation and Sorting on a Recursive Dual-Net. J. Inf. Process. Syst. 7(2): 271-286 (2011) - [c41]Aastha Madaan, Wanming Chu, Subhash Bhalla
VisHue: Web Page Segmentation for an Improved Query Interface for MedlinePlus Medical Encyclopedia. DNIS 2011: 89-108 - [c40]Shelly Sachdeva
Dynamic Generation of Archetype-Based User Interfaces for Queries on Electronic Health Record Databases. DNIS 2011: 109-125 - [c39]Yamin Li, Shietung Peng, Wanming Chu:
Hierarchical Dual-Net: A Flexible Interconnection Network and Its Routing Algorithm. ICNC 2011: 58-67 - [c38]Yamin Li, Shietung Peng, Wanming Chu:
Set-to-Set Disjoint-Paths Routing in Recursive Dual-Net. ICA3PP (1) 2011: 54-65 - [c37]Yamin Li, Shietung Peng, Wanming Chu:
Finding a Hamiltonian Cycle in a Hierarchical Dual-Net with Base Network of p -Ary q -Cube. ICA3PP (1) 2011: 117-128 - 2010
- [j4]Yamin Li, Shietung Peng, Wanming Chu:
Metacube - a versatile family of interconnection networks for extremely large-scale supercomputers. J. Supercomput. 53(2): 329-351 (2010) - [c36]Yamin Li, Shietung Peng, Wanming Chu:
Collective Communication in Recursive Dual-Net: An Interconnection Network for High-Performance Parallel Computer Systems of the Next Generation. CIT 2010: 147-154 - [c35]Yamin Li, Shietung Peng, Wanming Chu:
Node-to-Set Disjoint-Paths Routing in Recursive Dual-Net. ICNC 2010: 9-14 - [c34]Yamin Li, Shietung Peng, Wanming Chu:
Parallel Prefix Computation in the Recursive Dual-Net. ICA3PP (1) 2010: 54-64 - [c33]Yamin Li, Shietung Peng, Wanming Chu:
Parallel Sorting on Recursive Dual-Nets. PDCAT 2010: 110-117
2000 – 2009
- 2009
- [j3]Yamin Li, Shietung Peng, Wanming Chu:
Optimal Algorithms for Finding a Trunk on a Tree Network and its Applications. Comput. J. 52(2): 268-275 (2009) - [c32]Yamin Li, Shietung Peng, Wanming Chu:
Hamiltonian Connectedness of Recursive Dual-Net. CIT (1) 2009: 203-208 - [c31]Yamin Li, Shietung Peng, Wanming Chu:
The Recursive Dual-Net and Its Applications. APPT 2009: 363-374 - [c30]Yamin Li, Shietung Peng, Wanming Chu:
An Efficient Parallel Sorting Algorithm on Metacube Multiprocessors. ICA3PP 2009: 372-383 - [c29]Yamin Li, Shietung Peng, Wanming Chu:
Recursive Dual-Net: A New Universal Network for Supercomputers of the Next Generation. ICA3PP 2009: 809-820 - [c28]Yamin Li, Shietung Peng, Wanming Chu:
Disjoint-Paths and Fault-Tolerant Routing on Recursive Dual-Net. PDCAT 2009: 48-56 - 2008
- [c27]Yamin Li, Shietung Peng, Wanming Chu:
A Distributed Algorithm for Finding a Tree Trunk and its Application for Multicast in Mobile Ad Hoc Networks. AINA 2008: 106-113 - [c26]Yamin Li, Shietung Peng, Wanming Chu:
K-Trunk and Efficient Algorithms for Finding a K-Trunk on a Tree Network. HICSS 2008: 472 - [c25]Yamin Li, Shietung Peng, Wanming Chu:
Prefix Computation and Sorting in Dual-Cube. ICPP 2008: 389-396 - [c24]Yamin Li, Shietung Peng, Wanming Chu:
K-Tree Trunk and a Distributed Algorithm for Effective Overlay Multicast on Mobile Ad Hoc Networks. ISPAN 2008: 53-58 - [c23]Yamin Li, Shietung Peng, Wanming Chu:
An Effective Structure for Algorithmic Design and a Parallel Prefix Algorithm on Metacube. PDCAT 2008: 54-61 - 2007
- [c22]Yamin Li, Shietung Peng, Wanming Chu:
An Algorithm for Constructing Hamiltonian Cycle in Metacube Networks. PDCAT 2007: 285-292 - [c21]Yamin Li, Shietung Peng, Wanming Chu:
Efficient Algorithms for Finding a Trunk on a Tree Network and Its Applications. PDCAT 2007: 355-362 - 2006
- [c20]Yamin Li, Shietung Peng, Wanming Chu:
An Efficient Algorithm for Finding an Almost Connected Dominating Set of Small Size on Wireless Ad Hoc Networks. MASS 2006: 199-205 - [c19]Yamin Li, Shietung Peng, Wanming Chu:
K-MCore for Multicasting on Mobile Ad Hoc Networks. PDCAT 2006: 109-114 - 2005
- [j2]Yamin Li, Shietung Peng, Wanming Chu:
Fault-tolerant cycle embedding in dual-cube with node faults. Int. J. High Perform. Comput. Netw. 3(1): 45-53 (2005) - [c18]Yamin Li, Shietung Peng, Wanming Chu:
Adaptive Box-Based Efficient Fault-tolerant Routing in 3D Torus. ICPADS (1) 2005: 71-77 - [c17]Yamin Li, Shietung Peng, Wanming Chu:
Online Adaptive Fault-Tolerant Routing in 2D Torus. ISPA 2005: 150-161 - [c16]Yamin Li, Shietung Peng, Wanming Chu:
An Efficient Distributed Broadcasting Algorithm forWireless Ad Hoc Networks. PDCAT 2005: 75-79 - 2004
- [j1]Yamin Li, Shietung Peng, Wanming Chu:
Efficient Collective Communications in Dual-Cube. J. Supercomput. 28(1): 71-90 (2004) - [c15]Yamin Li, Shietung Peng, Wanming Chu:
Adaptive-Subcube Fault Tolerant Routing in Dual-Cube with Very Large Number of Faulty Nodes. PDCS 2004: 222-228 - [c14]Yamin Li, Shietung Peng, Wanming Chu:
Binomial-Tree Fault Tolerant Routing in Dual-Cubes with Large Number of Faulty Nodes. CIS 2004: 51-56 - [c13]Yamin Li, Shietung Peng, Wanming Chu:
An Efficient Algorithm for Fault Tolerant Routing Based on Adaptive Binomial-Tree Technique in Hypercubes. PDCAT 2004: 196-201 - [c12]Yamin Li, Shietung Peng, Wanming Chu:
Fault-tolerant cycle embedding in hypercube with mixed link and node failures. Parallel and Distributed Computing and Networks 2004: 561-566 - 2002
- [c11]Yamin Li, Shietung Peng, Wanming Chu:
From Dual-Cube to Metacube: Efficient Low-Degree Alternatives to Hypercube. CW 2002: 85-94 - [c10]Yamin Li, Shietung Peng, Wanming Chu:
Efficient Communication in Metacube: A New Interconnection Network. ISPAN 2002: 165- - 2001
- [c9]Kenji Watanabe, Wanming Chu, Yamin Li:
Exploiting Java Instruction/Thread Level Parallelism with Horizontal Multithreading. ACSAC 2001: 35-44 - 2000
- [c8]Wanming Chu, Yamin Li:
Cost/Performance Tradeoff of n-Select Square Root Implementations. ACAC 2000: 9-16
1990 – 1999
- 1997
- [c7]Yamin Li, Wanming Chu:
Implementation of single precision floating point square root on FPGAs. FCCM 1997: 226-233 - [c6]Yamin Li, Wanming Chu:
Parallel-Array Implementations of a Non-Restoring Square Root Algorithm. ICCD 1997: 690-695 - 1996
- [c5]Yamin Li, Wanming Chu:
Aizup-a pipelined processor design and implementation on XILINX FPGA chip. FCCM 1996: 98-106 - [c4]Yamin Li, Wanming Chu:
A New Non-Restoring Square Root Algorithm and its VLSI Implementation. ICCD 1996: 538-544 - [c3]Yamin Li, Wanming Chu:
Using FPGA for computer architecture/organization education. WCAE@HPCA 1996: 5 - 1995
- [c2]Yamin Li, Wanming Chu:
The Effects of STEF in Finely Parallel Multithreaded Processors. HPCA 1995: 318-325 - [c1]Yamin Li, Wanming Chu:
Design and Implementation of a Multiple-Instruction-Stream. Parallel and Distributed Computing and Systems 1995: 477-480
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 22:59 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: