Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 225,217,469 papers from all fields of science
Search
Sign In
Create Free Account
Kernelization
Known as:
Kernel
In computer science, a kernelization is a technique for designing efficient algorithms that achieve their efficiency by a preprocessing stage in…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
22 relations
Algorithm
Algorithmic paradigm
Bidimensionality
Bipartite dimension
Expand
Broader (1)
Analysis of algorithms
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
Tied factors analysis for high-dimensional image feature extraction and recognition application
Hai-bin Liao
,
Youbin Chen
,
Wenhua Dai
,
Ruolin Ruan
Pattern Analysis and Applications
2017
Corpus ID: 8503762
Abstract Feature extraction from images, which are typical of high dimensionality, is crucial to the recognition performance. To…
Expand
2013
2013
Linear Sequence Discriminant Analysis: A Model-Based Dimensionality Reduction Method for Vector Sequences
Bing Su
,
Xiaoqing Ding
IEEE International Conference on Computer Vision
2013
Corpus ID: 768931
Dimensionality reduction for vectors in sequences is challenging since labels are attached to sequences as a whole. This paper…
Expand
2011
2011
Parallel vertex cover: a case study in dynamic load balancing
Weerapurage Dinesh Premalal
,
John D. Eblen
,
Gary L. Rogers
,
M. Langston
2011
Corpus ID: 7960563
The significance of dynamic parallel load balancing is considered in the context of fixed parameter tractability. The well known…
Expand
2008
2008
Semi-supervised sub-manifold discriminant analysis
Yangqiu Song
,
F. Nie
,
Changshui Zhang
Pattern Recognition Letters
2008
Corpus ID: 33231740
2008
2008
Similarity Score Fusion by Ranking Risk Minimization for 3D Object Retrieval
C. B. Akgül
,
B. Sankur
,
Y. Yemez
,
F. Schmitt
3DOR@Eurographics
2008
Corpus ID: 14237358
In this work, we introduce a score fusion scheme to improve the 3D object retrieval performance. The state of the art in 3D…
Expand
Highly Cited
2007
Highly Cited
2007
Crown Structures for Vertex Cover Kernelization
F. Abu-Khzam
,
M. Fellows
,
M. A. Langston
,
W. Suters
Theory of Computing Systems
2007
Corpus ID: 2174477
Crown structures in a graph are defined and shown to be useful in kernelization algorithms for the classic vertex cover problem…
Expand
2007
2007
Directed Feedback Vertex Set Problem is FPT
Jianer Chen
,
Yang Liu
,
Songjian Lu
Structure Theory and FPT Algorithmics for Graphs…
2007
Corpus ID: 7156904
To decide if the parameterized feedback vertex set problem in directed graph is fixed-parameter tractable is a long standing open…
Expand
2006
2006
The Computational Complexity of the Unrooted Subtree Prune and Regraft Distance
G. Hickey
,
F. Dehne
,
A. Rau-Chaplin
,
C. Blouin
2006
Corpus ID: 55594195
We show that computation of the subtree prune and regraft (SPR) distance between unrooted binary phylogenetic trees is NP-Hard…
Expand
2004
2004
A fixed-parameter tractable algorithm for matrix domination
Mark Weston
Information Processing Letters
2004
Corpus ID: 205480719
2003
2003
An FPT Algorithm for Set Splitting
F. Dehne
,
M. Fellows
,
Frances A. Rosamond
International Workshop on Graph-Theoretic…
2003
Corpus ID: 2102380
An FPT algorithm with a running time of O(n 4 + 2 O(k) n 2.5) is described for the Set Splitting problem, parameterized by the…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE