Sciweavers

14518 search results - page 181 / 2904
» Two Problems for Sophistication
Sort
View
PAMI
2010
122views more  PAMI 2010»
13 years 9 months ago
Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy
—This paper addresses pattern classification in the framework of domain adaptation by considering methods that solve problems in which training data are assumed to be available o...
Lorenzo Bruzzone, Mattia Marconcini
ICDM
2009
IEEE
131views Data Mining» more  ICDM 2009»
13 years 8 months ago
Unified Solution to Nonnegative Data Factorization Problems
In this paper, we restudy the non-convex data factorization problems (regularized or not, unsupervised or supervised), where the optimization is confined in the nonnegative orthan...
Xiaobai Liu, Shuicheng Yan, Jun Yan, Hai Jin
IWPEC
2009
Springer
14 years 5 months ago
A Probabilistic Approach to Problems Parameterized above or below Tight Bounds
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds or below tight upper bounds. To illustrate the approac...
Gregory Gutin, Eun Jung Kim, Stefan Szeider, Ander...
TAMC
2009
Springer
14 years 5 months ago
Approximability and Fixed-Parameter Tractability for the Exemplar Genomic Distance Problems
In this paper, we present a survey of the approximability and fixed-parameter tractability results for some Exemplar Genomic Distance problems. We mainly focus on three problems: ...
Binhai Zhu
DEXAW
2008
IEEE
119views Database» more  DEXAW 2008»
14 years 5 months ago
Evolutionary Approaches to Linear Ordering Problem
Linear Ordering Problem (LOP) is a well know optimization problem attractive for its complexity (it is a NPhard problem), rich collection of testing data and variety of real world...
Václav Snásel, Pavel Krömer, Ja...