default search action
Jakub Koperwas
Person information
- affiliation: Warsaw University of Technology, Poland
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j5]Mikolaj Markiewicz
, Jakub Koperwas:
Evaluation Platform for DDM Algorithms With the Usage of Non-Uniform Data Distribution Strategies. Int. J. Inf. Technol. Syst. Approach 15(1): 1-23 (2022) - [c8]Mikolaj Markiewicz, Jakub Koperwas:
Data Partitioning Strategies for Simulating non-IID Data Distributions in the DDM-PS-Eval Evaluation Platform. ICSOFT 2022: 307-318
2010 – 2019
- 2019
- [j4]Mikolaj Markiewicz
, Jakub Koperwas:
Hybrid Partitioning-Density Algorithm for K-Means Clustering of Distributed Data Utilizing OPTICS. Int. J. Data Warehous. Min. 15(4): 1-20 (2019) - 2017
- [j3]Jakub Koperwas
, Lukasz Skonieczny
, Marek Kozlowski, Piotr Andruszkiewicz
, Henryk Rybinski
, Waclaw Struk
:
Intelligent information processing for building university knowledge base. J. Intell. Inf. Syst. 48(1): 141-163 (2017) - [j2]Henryk Rybinski
, Lukasz Skonieczny
, Jakub Koperwas
, Waclaw Struk
, Jolanta Stepniak, Weronika Kubrak
:
Integrating IR with CRIS - a novel researcher-centric approach. Program 51(3): 298-321 (2017) - [c7]Michal Debski, Jakub Janusz Koperwas
:
Web-Enabled Discovery and Launch. MoMM 2017: 191-195 - 2014
- [c6]Jakub Koperwas
, Lukasz Skonieczny
, Marek Kozlowski, Piotr Andruszkiewicz
, Henryk Rybinski
, Waclaw Struk
:
AI Platform for Building University Research Knowledge Base. ISMIS 2014: 405-414 - [p2]Jakub Koperwas
, Lukasz Skonieczny
, Marek Kozlowski, Henryk Rybinski
, Waclaw Struk
:
University Knowledge Base: Two Years of Experience. Intelligent Tools for Building a Scientific Information Platform 2014: 257-274 - 2013
- [p1]Jakub Koperwas
, Lukasz Skonieczny
, Henryk Rybinski
, Waclaw Struk
:
Development of a University Knowledge Base. Intelligent Tools for Building a Scientific Information Platform 2013: 97-110 - 2011
- [j1]Jakub Koperwas
, Krzysztof Walczak:
Tree Edit Distance for Leaf-labelled trees on free leafset and its comparison with Frequent Subsplit dissimilarity and popular distance measures. BMC Bioinform. 12: 204 (2011)
2000 – 2009
- 2008
- [c5]Jakub Koperwas
, Krzysztof Walczak:
Frequent Subsplit Representation of Leaf-Labelled Trees. EvoBIO 2008: 95-105 - [c4]Jakub Koperwas
, Krzysztof Walczak:
Phylogenetic Trees Dissimilarity Measure Based on Strict Frequent Splits Set and Its Application for Clustering. RSKT 2008: 604-611 - 2007
- [c3]Jakub Koperwas
, Krzysztof Walczak:
Clustering of Leaf-Labelled Trees. ICANNGA (1) 2007: 702-710 - [c2]Jakub Koperwas
, Krzysztof Walczak:
Clustering of Leaf-Labelled Trees on Free Leafset. RSEISP 2007: 736-745 - 2006
- [c1]Jakub Koperwas
, Krzysztof Walczak:
A Similarity Measure between Tandem Duplication Trees. Intelligent Information Systems 2006: 163-172
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 2025-01-20 23:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint