Results 11 to 20 of about 197 (95)
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
Parameter Ecology for Feedback Vertex Set
Tsinghua Science and Technology, 2014 This paper deals with the Feedback Vertex Set problem on undirected graphs, which asks for the existence of a vertex set of bounded size that intersects all cycles.
Bart M. P. Jansen +2 more
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
A Dimension Reduction Framework for HSI Classification Using Fuzzy and Kernel NFLE Transformation
Remote Sensing, 2015 In this paper, a general nearest feature line (NFL) embedding (NFLE) transformation called fuzzy-kernel NFLE (FKNFLE) is proposed for hyperspectral image (HSI) classification in which kernelization and fuzzification are simultaneously considered.
Ying-Nong Chen +4 more
doaj +1 more source
Dynamic Dominating Set and Turbo-Charging Greedy Heuristics
Tsinghua Science and Technology, 2014 The main purpose of this paper is to exposit two very different, but very general, motivational schemes in the art of parameterization and a concrete example connecting them.
Rodney G. Downey +4 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
Parameterized Algorithmics for Computational Social Choice: Nine Research Challenges
Tsinghua Science and Technology, 2014 Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on the other ...
Robert Bredereck +5 more
doaj +1 more source
IEEE Access, 2021 For finding keys to understand and elucidate a phenomenon, it is essential to detect dependences among variables, and so measures for that have been proposed.
Miho Ohsaki +7 more
doaj +1 more source