Sciweavers

4131 search results - page 70 / 827
» The Generalized Max-Controlled Set Problem
Sort
View
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 3 months ago
Homogeneous String Segmentation using Trees and Weighted Independent Sets
We divide a string into k segments, each with only one sort of symbols, so as to minimize the total number of exceptions. Motivations come from machine learning and data mining. F...
Peter Damaschke
KDD
2005
ACM
139views Data Mining» more  KDD 2005»
16 years 3 months ago
Reasoning about sets using redescription mining
Redescription mining is a newly introduced data mining problem that seeks to find subsets of data that afford multiple definitions. It can be viewed as a generalization of associa...
Mohammed Javeed Zaki, Naren Ramakrishnan
KR
2010
Springer
15 years 7 months ago
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relat...
Reinhard Pichler, Stefan Rümmele, Stefan Szei...
FLAIRS
1998
15 years 4 months ago
Generating Diagnoses from Conflict Sets
Many techniques of finding possible diagnoses of faulty technical systems involve two sequential steps. First compute the collection of all minimal conflict sets, then transform t...
Rolf Haenni
EPS
1998
Springer
15 years 7 months ago
Evolutionary Search for Minimal Elements in Partially Ordered Finite Sets
The task of finding minimal elements of a partially ordered set is a generalization of the task of finding the global minimum of a real-valued function or of finding Pareto-optimal...
Günter Rudolph