Sciweavers

1542 search results - page 204 / 309
» Kernelization of packing problems
Sort
View
STOC
2010
ACM
224views Algorithms» more  STOC 2010»
15 years 6 months ago
Satisfiability Allows No Nontrivial Sparsification Unless The Polynomial-Time Hierarchy Collapses
Consider the following two-player communication process to decide a language L: The first player holds the entire input x but is polynomially bounded; the second player is computa...
Holger Dell and Dieter van Melkebeek
BMCBI
2007
93views more  BMCBI 2007»
15 years 1 months ago
SVM-Fold: a tool for discriminative multi-class protein fold and superfamily recognition
Background: Predicting a protein’s structural class from its amino acid sequence is a fundamental problem in computational biology. Much recent work has focused on developing ne...
Iain Melvin, Eugene Ie, Rui Kuang, Jason Weston, W...
CORR
2002
Springer
144views Education» more  CORR 2002»
15 years 1 months ago
Polynomial Time Data Reduction for Dominating Set
Dealing with the NP-complete Dominating Set problem on graphs, we demonstrate the power of data reduction by preprocessing from a theoretical as well as a practical side. In parti...
Jochen Alber, Michael R. Fellows, Rolf Niedermeier
ICCV
2009
IEEE
16 years 6 months ago
Robust Fitting of Multiple Structures: The Statistical Learning Approach
We propose an unconventional but highly effective approach to robust fitting of multiple structures by using statistical learning concepts. We design a novel Mercer kernel for t...
Tat-Jun Chin, Hanzi Wang, David Suter
ICPR
2006
IEEE
16 years 3 months ago
A Minimum Sphere Covering Approach to Pattern Classification
In this paper we present a minimum sphere covering approach to pattern classification that seeks to construct a minimum number of spheres to represent the training data and formul...
Jigang Wang, Predrag Neskovic, Leon N. Cooper