Sciweavers

648 search results - page 4 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
TFS
2008
120views more  TFS 2008»
13 years 4 months ago
Aggregation Using the Fuzzy Weighted Average as Computed by the Karnik-Mendel Algorithms
Abstract--By connecting work from two different problems-the fuzzy weighted average (FWA) and the generalized centroid of an interval type-2 fuzzy set--a new -cut algorithm for sol...
Feilong Liu, Jerry M. Mendel
ICCI
1991
13 years 9 months ago
On the k-Coloring of Intervals
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...
Martin C. Carlisle, Errol L. Lloyd
ICPR
2010
IEEE
13 years 6 months ago
The Problem of Fragile Feature Subset Preference in Feature Selection Methods and a Proposal of Algorithmic Workaround
Abstract—We point out a problem inherent in the optimization scheme of many popular feature selection methods. It follows from the implicit assumption that higher feature selecti...
Petr Somol, Jiri Grim, Pavel Pudil
ICALP
2011
Springer
12 years 9 months ago
Clique Clustering Yields a PTAS for max-Coloring Interval Graphs
We are given an interval graph G = (V, E) where each interval I ∈ V has a weight wI ∈ R+. The goal is to color the intervals V with an arbitrary number of color classes C1, C2...
Tim Nonner
IJCGA
2008
114views more  IJCGA 2008»
13 years 5 months ago
Fixed Parameter Algorithms for the Minimum Weight Triangulation Problem
Published as Technical Report LU-CS-TR:2005-238 on February 13, 2006, ISSN 1650-1276 Report 158, Lund University, Sweden 2006 We discuss and compare four fixed parameter algorithm...
Magdalene G. Borgelt, Christian Borgelt, Christos ...