Results 21 to 30 of about 111,097 (310)
Algorithms for comparing large pedigree graphs
Advances in Computing and Engineering, 2022 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
Algorithms, 2020 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
Journal of the ACM, 2009 In a parameterized problem, every instance I comes with a positive integer k . The problem is said to admit a polynomial kernel if, in polynomial time, one can reduce the size of the instance I to a polynomial in k while preserving the answer ...
Hans L. Bodlaender +5 more
openaire +8 more sources
Advances in Data Science and Adaptive Analysis, 2019 A new method for hierarchical clustering of data points is presented. It combines treelets, a particular multiresolution decomposition of data, with a mapping on a reproducing kernel Hilbert space. The proposed approach, called kernel treelets (KT), uses this mapping to go from a hierarchical clustering over attributes (the natural output of treelets)
Hedi Xia, Hector D. Ceniceros
openaire +2 more sources
Unsupervised Transfer Learning via Relative Distance Comparisons
IEEE Access, 2020 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
Exact and kernelization algorithms for Closet String
Selecciones Matemáticas, 2020 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
A Brief Survey of Fixed-Parameter Parallelism
Algorithms, 2020 This paper provides an overview of the field of parameterized parallel complexity by surveying previous work in addition to presenting a few new observations and exploring potential new directions.
Faisal N. Abu-Khzam, Karam Al Kontar
doaj +1 more source
Complexity, 2022 Extreme Learning Machine (ELM) is widely used in various fields because of its fast training and high accuracy. However, it does not primarily work well for Domain Adaptation (DA) in which there are many annotated data from auxiliary domain and few even ...
Shaofei Zang +5 more
doaj +1 more source
Improving Vertex Cover as a Graph Parameter [PDF]
Discrete Mathematics & Theoretical Computer Science, 2015 Parameterized algorithms are often used to efficiently solve NP-hard problems on graphs. In this context, vertex cover is used as a powerful parameter for dealing with graph problems which are hard to solve even when parameterized by tree-width; however,
Robert Ganian
doaj +1 more source
Tight Kernel Bounds for Problems on Graphs with Small Degeneracy [PDF]
, 2013 In this paper we consider kernelization for problems on d-degenerate graphs, i.e. graphs such that any subgraph contains a vertex of degree at most $d$.
D. Harnik +15 more
core +2 more sources