Sciweavers

276 search results - page 46 / 56
» From Model-Checking to Temporal Logic Constraint Solving
Sort
View
161
Voted
ICANN
2009
Springer
15 years 10 months ago
Constrained Learning Vector Quantization or Relaxed k-Separability
Neural networks and other sophisticated machine learning algorithms frequently miss simple solutions that can be discovered by a more constrained learning methods. Transition from ...
Marek Grochowski, Wlodzislaw Duch
159
Voted
CONCUR
2004
Springer
15 years 11 months ago
Characterizing EF and EX Tree Logics
We describe the expressive power of temporal branching time logics that use the modalities EX and EF. We give a forbidden pattern characterization of the tree languages definable...
Mikolaj Bojanczyk, Igor Walukiewicz
KDD
2012
ACM
194views Data Mining» more  KDD 2012»
13 years 8 months ago
A sparsity-inducing formulation for evolutionary co-clustering
Traditional co-clustering methods identify block structures from static data matrices. However, the data matrices in many applications are dynamic; that is, they evolve smoothly o...
Shuiwang Ji, Wenlu Zhang, Jun Liu
CORR
2010
Springer
144views Education» more  CORR 2010»
15 years 5 months ago
CLP-based protein fragment assembly
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
Alessandro Dal Palù, Agostino Dovier, Feder...
PASTE
2004
ACM
15 years 11 months ago
Resolving and applying constraint queries on context-sensitive analyses
A context-sensitive analysis is an analysis in which program elements are assigned sets of properties that depend upon the context in which they occur. For analyses on imperative ...
James Ezick