Sciweavers

8 search results - page 1 / 2
» Average Parameterization and Partial Kernelization for Compu...
Sort
View
23
Voted
LATIN
2010
Springer
14 years 4 months ago
Average Parameterization and Partial Kernelization for Computing Medians
Nadja Betzler, Jiong Guo, Christian Komusiewicz, R...
IWPEC
2010
Springer
13 years 7 months ago
Partial Kernelization for Rank Aggregation: Theory and Experiments
RANK AGGREGATION is important in many areas ranging from web search over databases to bioinformatics. The underlying decision problem KEMENY SCORE is NP-complete even in case of fo...
Nadja Betzler, Robert Bredereck, Rolf Niedermeier
ECML
2006
Springer
14 years 1 months ago
Efficient Convolution Kernels for Dependency and Constituent Syntactic Trees
In this paper, we provide a study on the use of tree kernels to encode syntactic parsing information in natural language learning. In particular, we propose a new convolution kerne...
Alessandro Moschitti
TCS
2010
13 years 8 months ago
Clustering with partial information
The Correlation Clustering problem, also known as the Cluster Editing problem, seeks to edit a given graph by adding and deleting edges to obtain a collection of disconnected cliq...
Hans L. Bodlaender, Michael R. Fellows, Pinar Hegg...
GECCO
2009
Springer
167views Optimization» more  GECCO 2009»
14 years 4 months ago
Fixed-parameter evolutionary algorithms and the vertex cover problem
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
Stefan Kratsch, Frank Neumann