Sciweavers

1722 search results - page 253 / 345
» Variables in Concept Graphs
Sort
View
JODS
2007
102views Data Mining» more  JODS 2007»
15 years 3 months ago
Default Clustering with Conceptual Structures
This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It...
Julien Velcin, Jean-Gabriel Ganascia
JODS
2007
119views Data Mining» more  JODS 2007»
15 years 3 months ago
Semantic Matching: Algorithms and Implementation
We view match as an operator that takes two graph-like structures (e.g., classifications, XML schemas) and produces a mapping between the nodes of these graphs that correspond sema...
Fausto Giunchiglia, Mikalai Yatskevich, Pavel Shva...
PAMI
2007
113views more  PAMI 2007»
15 years 3 months ago
Dominant Sets and Pairwise Clustering
—We develop a new graph-theoretic approach for pairwise data clustering which is motivated by the analogies between the intuitive concept of a cluster and that of a dominant set ...
Massimiliano Pavan, Marcello Pelillo
IFM
2010
Springer
204views Formal Methods» more  IFM 2010»
15 years 2 months ago
Collaborative Modelling and Co-simulation in the Development of Dependable Embedded Systems
This paper presents initial results of research aimed at developing methods and tools for multidisciplinary collaborative development of dependable embedded systems. We focus on th...
John S. Fitzgerald, Peter Gorm Larsen, Ken Pierce,...
PPDP
2010
Springer
15 years 2 months ago
Dimensions in program synthesis
Program Synthesis, which is the task of discovering programs that realize user intent, can be useful in several scenarios: enabling people with no programming background to develo...
Sumit Gulwani