default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBiplab Kumer Sarker
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2008
[j3]Biplab Kumer Sarker, Peter Wallace, Will Gill:
Some observations on mind map and ontology building tools for knowledge management. Ubiquity 2008(March): 2:1-2:9 (2008)- 2006
- [c10]Biplab Kumer Sarker, Anil Kumar Tripathi, Deo Prakash Vidyarthi, Laurence Tianruo Yang, Kuniaki Uehara:
Multiple Tasks Allocation in Arbitrarily Connected Distributed Computing Systems Using A* Algorithm and Genetic Algorithm. ISPA Workshops 2006: 279-290 - 2005
- [c9]Biplab Kumer Sarker, Hiroyuki Kitagawa:
A Distributed Algorithm for Outlier Detection in a Large Database. DNIS 2005: 300-309 - [c8]Biplab Kumer Sarker, Anil Kumar Tripathi, Deo Prakash Vidyarthi, Laurence Tianruo Yang, Kuniaki Uehara:
Load Balanced Allocation of Multiple Tasks in a Distributed Computing System. EUC 2005: 584-596 - [c7]Biplab Kumer Sarker, Kuniaki Uehara, Laurence Tianruo Yang:
Exploiting Efficient Parallelism for Mining Rules in Time Series Data. HPCC 2005: 845-855 - [c6]Lu Yang, Biplab Kumer Sarker, Virendrakumar C. Bhavsar, Harold Boley:
A Weighted-Tree Simplicity Algorithm for Similarity Matching of Partial Product Descriptions. IASSE 2005: 55-60 - [c5]Lu Yang, Biplab Kumer Sarker, Virendrakumar C. Bhavsar, Harold Boley:
Range Similarity Measures Between Buyers and Sellers in e-Marketplaces. IICAI 2005: 2559-2572 - [c4]Biplab Kumer Sarker, Toshiya Hirata, Kuniaki Uehara, Virendra C. Bhavsar:
Mining Association Rules from Multi-stream Time Series Data on Multiprocessor Systems. ISPA 2005: 662-667 - 2004
- [j2]Biplab Kumer Sarker, Anil Kumar Tripathi, Deo Prakash Vidyarthi, Laurence Tianruo Yang, Kuniaki Uehara:
Allocation of Tasks in a DCS Using a Different Approach with A* Considering Load. IEICE Trans. Inf. Syst. 87-D(7): 1859-1866 (2004) - [c3]Deo Prakash Vidyarthi, Anil Kumar Tripathi, Biplab Kumer Sarker, Abhishek Dhawan, Laurence Tianruo Yang:
Cluster-Based Multiple Task Allocation in Distributed Computing System. IPDPS 2004 - 2003
- [c2]Biplab Kumer Sarker, Toshiya Hirata, Kuniaki Uehara:
Sequential Association Rules from Multi-Stream Time Series Data - A Lattice Based Parallel Mining Approach. IICAI 2003: 1328-1337 - [c1]Biplab Kumer Sarker, Takaki Mori, Toshiya Hirata, Kuniaki Uehara:
Parallel Algorithms for Mining Association Rules in Time Series Data. ISPA 2003: 273-284 - 2000
- [j1]Anil Kumar Tripathi, Biplab Kumer Sarker, Naveen Kumar, Deo Prakash Vidyarthi:
A GA Based Multiple Task Allocation Considering Load. Int. J. High Speed Comput. 11(4): 203-214 (2000)
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-25 05:44 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:
