Sciweavers

1220 search results - page 99 / 244
» Minimal Interval Completions
Sort
View
SDM
2008
SIAM
123views Data Mining» more  SDM 2008»
13 years 10 months ago
Constrained Co-clustering of Gene Expression Data
In many applications, the expert interpretation of coclustering is easier than for mono-dimensional clustering. Co-clustering aims at computing a bi-partition that is a collection...
Ruggero G. Pensa, Jean-François Boulicaut
ICMLA
2003
13 years 10 months ago
Fast Class-Attribute Interdependence Maximization (CAIM) Discretization Algorithm
– Discretization is a process of converting a continuous attribute into an attribute that contains small number of distinct values. One of the major reasons for discretizing an a...
Lukasz A. Kurgan, Krzysztof J. Cios
IJCAI
2003
13 years 10 months ago
Incremental Tractable Reasoning about Qualitative Temporal Constraints
In many applications of temporal reasoning we are in­ terested in reasoning incrementally In particular, given a CSP of temporal constrains and a new constraint, we want to maint...
Alfonso Gerevini
MIC
2003
116views Control Systems» more  MIC 2003»
13 years 10 months ago
On the Linear Quadratic Minimum-fuel Problem
E.I.Verriest and F.L.Lewis have presented in [1] a new method to approach the minimum-time control of linear continous-time systems avoiding the Bang-Bang control. Their method re...
H. Benazza, N. El Alami
DYNAMO
2000
74views more  DYNAMO 2000»
13 years 10 months ago
A framework for remote dynamic program optimization
Dynamic program optimization allows programs to be generated that are highly tuned for a given environment and input data set. Optimization techniques can be applied and re-applie...
Michael Voss, Rudolf Eigenmann