Sciweavers

16404 search results - page 468 / 3281
» A set coverage problem
Sort
View
ICAL
2011
301views more  ICAL 2011»
14 years 6 months ago
On the LVI-based numerical method (E47 algorithm) for solving quadratic programming problems
— In this paper, a numerical method (termed, E47 algorithm) based on linear variational inequalities (LVI) is presented and investigated to solve quadratic programming (QP) probl...
Yunong Zhang, Senbo Fu, Zhijun Zhang, Lin Xiao, Xu...
ICML
2003
IEEE
16 years 7 months ago
The Pre-Image Problem in Kernel Methods
In this paper, we address the problem of finding the pre-image of a feature vector in the feature space induced by a kernel. This is of central importance in some kernel applicatio...
James T. Kwok, Ivor W. Tsang
CP
2009
Springer
16 years 7 months ago
Solving a Location-Allocation Problem with Logic-Based Benders' Decomposition
Abstract. We address a location-allocation problem that requires deciding the location of a set of facilities, the allocation of customers to those facilities under facility capaci...
Mohammad M. Fazel-Zarandi, J. Christopher Beck
DNA
2009
Springer
185views Bioinformatics» more  DNA 2009»
16 years 1 months ago
NP-Completeness of the Direct Energy Barrier Problem without Pseudoknots
Knowledge of energy barriers between pairs of secondary structures for a given DNA or RNA molecule is useful, both in understanding RNA function in biological settings and in desig...
Ján Manuch, Chris Thachuk, Ladislav Stacho,...
IDA
2009
Springer
16 years 1 months ago
Bayesian Solutions to the Label Switching Problem
Abstract. The label switching problem, the unidentifiability of the permutation of clusters or more generally latent variables, makes interpretation of results computed with MCMC ...
Kai Puolamäki, Samuel Kaski