Sciweavers

464 search results - page 57 / 93
» Subsystem Based Generalizations of Rough Set Approximations
Sort
View
COCOA
2008
Springer
15 years 1 months ago
New Algorithms for k-Center and Extensions
The problem of interest is covering a given point set with homothetic copies of several convex containers C1,...,Ck, while the objective is to minimize the maximum over the dilatat...
René Brandenberg, Lucia Roth
COR
2007
108views more  COR 2007»
14 years 11 months ago
New primal-dual algorithms for Steiner tree problems
We present new primal-dual algorithms for several network design problems. The problems considered are the generalized Steiner tree problem (GST), the directed Steiner tree proble...
Vardges Melkonian
JMIV
2010
131views more  JMIV 2010»
14 years 10 months ago
An SL(2) Invariant Shape Median
Median averaging is a powerful averaging concept on sets of vector data in finite dimensions. A generalization of the median for shapes in the plane is introduced. The underlying ...
Benjamin Berkels, Gina Linkmann, Martin Rumpf
ICDM
2008
IEEE
120views Data Mining» more  ICDM 2008»
15 years 6 months ago
Parameter Tuning for Differential Mining of String Patterns
Constraint-based mining has been proven to be extremely useful for supporting actionable pattern discovery. However, useful conjunctions of constraints that support domain driven ...
Jérémy Besson, Christophe Rigotti, I...
CORR
2002
Springer
79views Education» more  CORR 2002»
14 years 11 months ago
Technical Note: Bias and the Quantification of Stability
Research on bias in machine learning algorithms has generally been concerned with the impact of bias on predictive accuracy. We believe that there are other factors that should al...
Peter D. Turney