Demo Data from EDBT 2026 / reviewers in the wild / expert
Krzysztof Walczak 0002
dblp:21/6573
· DBLP profile ↗
9ranked-venue papers
2as first author
0since 2021 · last 2011
—ORCID · conflict
Domains — the database's venue-derived domains; a paper can count in several
Databases, data management, data science and information retrieval · 4Graphics, computer vision, multimedia, augmented reality and games · 2 · 1 first-authorApplied, interdisciplinary, general and emerging computing · 2Systems, architecture and hardware · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Electronic design automation · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Electronic design automation › hardware verification and test › fault simulation
deductive fault simulation |
0.0 | 1 | 1988 | Deductive Fault Simulation for Sequential Module Circuits · IEEE Trans. Computers 1988 |
Electronic design automation › hardware verification and test
fault simulation |
0.0 | 1 | 1988 | Deductive Fault Simulation for Sequential Module Circuits · IEEE Trans. Computers 1988 |
Electronic design automation
hardware verification and test |
0.0 | 1 | 1988 | Deductive Fault Simulation for Sequential Module Circuits · IEEE Trans. Computers 1988 |
Electronic design automation › hardware verification and test
sequential circuit testing |
0.0 | 1 | 1988 | Deductive Fault Simulation for Sequential Module Circuits · IEEE Trans. Computers 1988 |
Methods — techniques the papers use, named apart from their topics
state-diagram representation · 0.0moore/mealy automata · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2011 | Tree Edit Distance for Leaf-labelled trees on free leafset and its comparison with Frequent Subsplit dissimilarity and popular distance measuresabstractBACKGROUND: This paper is devoted to distance measures for leaf-labelled trees on free leafset. A leaf-labelled tree is a data structure which is a special type of a tree where only leaves (terminal) nodes are labelled. This data structure is used in bioinformatics for modelling of evolution history of genes and species and also in linguistics for modelling of languages evolution history. Many domain specific problems occur and need to be solved with help of tree postprocessing techniques such as distance measures. RESULTS: Here we introduce the tree edit distance designed for leaf labelled trees on free leafset, which occurs to be a metric. It is presented together with tree edit consensus tree notion. We provide statistical evaluation of provided measure with respect to R-F, MAST and frequent subsplit based dissimilarity measures as the reference measures. CONCLUSIONS: The tree edit distance was proven to be a metric and has the advantage of using different costs for contraction and pruning, therefore their properties can be tuned depending on the needs of the user. Two of the presented methods carry the most interesting properties. E(3,1) is very discriminative (having a wide range of values) and has a very regular distance distribution which is similar to a normal distribution in its shape and is good both for similar and non-similar trees. NFC(2,1) on the other hand is proportional or nearly proportional to the number of mutation operations used, irrespective of their type. Jakub Koperwas, Krzysztof Walczak 0002 |
BMC Bioinform. | 2 |
| 2009 | Jumping Emerging Substrings in Image Classification
Lukasz Kobylinski, Krzysztof Walczak 0002 |
CAIP | 2 |
| 2009 | A new classification method using array Comparative Genome Hybridization data, based on the concept of Limited Jumping Emerging PatternsabstractBACKGROUND: Classification using aCGH data is an important and insufficiently investigated problem in bioinformatics. In this paper we propose a new classification method of DNA copy number data based on the concept of limited Jumping Emerging Patterns. We present the comparison of our limJEPClassifier to SVM which is considered the most successful classifier in the case of high-throughput data. RESULTS: Our results revealed that the classification performance using limJEPClassifier is significantly higher than other methods. Furthermore, we show that application of the limited JEP's can significantly improve classification, when strongly unbalanced data are given. CONCLUSION: Nowadays, aCGH has become a very important tool, used in research of cancer or genomic disorders. Therefore, improving classification of aCGH data can have a great impact on many medical issues such as the process of diagnosis and finding disease-related genes. The performed experiment shows that the application of Jumping Emerging Patterns can be effective in the classification of high-dimensional data, including these from aCGH experiments. Tomasz Gambin, Krzysztof Walczak 0002 |
BMC Bioinform. | 2 |
| 2008 | Jumping Emerging Patterns with Occurrence Count in Image Classification
Lukasz Kobylinski, Krzysztof Walczak 0002 |
PAKDD | 2 |
| 2008 | Local Projection in Jumping Emerging Patterns Discovery in Transaction Databases
Pawel Terlecki, Krzysztof Walczak 0002 |
PAKDD | 2 |
| 2007 | On the relation between rough set reducts and jumping emerging patterns
Pawel Terlecki, Krzysztof Walczak 0002 |
Inf. Sci. | 2 |
| 2007 | Jumping emerging patterns with negation in transaction databases - Classification and discovery
Pawel Terlecki, Krzysztof Walczak 0002 |
Inf. Sci. | 2 |
| 2001 | Image Retrieval Using Spatial Color Information
Krzysztof Walczak 0002 |
CAIP | 1 |
| 1988 | Deductive Fault Simulation for Sequential Module CircuitsabstractA cost-effective method is presented for the deductive simulation of fault effects propagating through sequential functional modules that are described by the state-diagram representation of a Moore or Mealy automaton. The cornerstone of the method is a novel definition of the internal fault list of a sequential module. The method can be particularly useful for sequential modules when the state assignment and the gate-level realization are unknown.> Krzysztof Walczak 0002 |
IEEE Trans. Computers | 1 |