Results 1 to 10 of about 1,405 (240)
An Overview of Kernelization Algorithms for Graph Modification Problems
Kernelization algorithms for graph modification problems are important ingredients in parameterized computation theory. In this paper, we survey the kernelization algorithms for four types of graph modification problems, which include vertex deletion ...
Jianxin Wang
exaly +3 more sources
Searching and Indexing Genomic Databases via Kernelization [PDF]
The rapid advance of DNA sequencing technologies has yielded databases of thousands of genomes. To search and index these databases effectively, it is important that we take advantage of the similarity between those genomes.
Travis eGagie, Simon ePuglisi
doaj +2 more sources
Expansion Lemma—Variations and Applications to Polynomial-Time Preprocessing
In parameterized complexity, it is well-known that a parameterized problem is fixed-parameter tractable if and only if it has a kernel—an instance equivalent to the input instance, whose size is just a function of the parameter.
Ashwin Jacob +2 more
doaj +1 more source
Clique Search in Graphs of Special Class and Job Shop Scheduling
In this paper, we single out the following particular case of the clique search problem. The vertices of the given graph are legally colored with k colors and we are looking for a clique with k nodes in the graph.
Sándor Szabó, Bogdán Zaválnij
doaj +1 more source
Exact and kernelization algorithms for Closet String
In this paper we address CLOSEST STRING problem that arises in web searching, coding theory and computational molecular biology. To solve it is to find a string that minimizes the maximum Hamming distance from a given set of strings. CLOSEST STRING is an
Omar Latorre Vilca
doaj +1 more source
This Special Issue contains eleven articles—surveys and research papers—that represent fresh and ambitious new directions in the area of Parameterized Complexity. They provide ground-breaking research at the frontiers of knowledge, and they contribute to
Neeldhara Misra +2 more
doaj +1 more source
Algorithms for comparing large pedigree graphs
The importance of pedigrees is translated by geneticists as a tool for diagnosing genetic diseases. Errors resulting during collection of data and missing information of individuals are considered obstacles in deducing pedigrees, especially larger ones ...
Nahla A. Belal +2 more
doaj +1 more source
Kernelization in Parameterized Computation: A Survey
Parameterized computation is a new method dealing with NP-hard problems, which has attracted a lot of attentions in theoretical computer science. As a practical preprocessing method for NP-hard problems, kernelizaiton in parameterized computation has ...
Qilong Feng +3 more
doaj +1 more source
Unsupervised Transfer Learning via Relative Distance Comparisons
Primitive machine learning method such as Support Vector Machine (SVM) or k-Nearest Neighbor (k-NN) faces a major challenge when its training and test data is distributed with large-scale variations in lighting conditions, color, backgrounds, size, etc ...
Rakesh Kumar Sanodiya, Leehter Yao
doaj +1 more source
Adaptive kernel fuzzy clustering for missing data
Many machine learning procedures, including clustering analysis are often affected by missing values. This work aims to propose and evaluate a Kernel Fuzzy C-means clustering algorithm considering the kernelization of the metric with local adaptive ...
Anny K. G. Rodrigues +2 more
doaj +2 more sources

