2489 search results - page 35 / 498 » On the Subgroup Distance Problem |
COCOON
2005
Springer
14 years 3 months ago
2005
Springer
Abstract. In this paper, we consider two types of inverse sorting problems. The first type is an inverse sorting problem under weighted Hamming distance with bound constraints, wh...
SPIRE
2005
Springer
14 years 3 months ago
2005
Springer
We introduce the notion of conservative edit distance and mapping between two RNA stem-loops. We show that unlike the general edit distance between RNA secondary structures, the co...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
ORL
1998
13 years 9 months ago
1998
This paper presents a simple procedure for accelerating convergence in a generalized Fermat–Weber problem with lp distances. The main idea is to multiply the predetermined step ...
ISDA
2009
IEEE
14 years 4 months ago
2009
IEEE
— In this contribution a feature selection method in semi-supervised problems is proposed. This method selects variables using a feature clustering strategy, using a combination ...