Sciweavers

1805 search results - page 121 / 361
» Functional programming with structured graphs
Sort
View
EUSFLAT
2007
124views Fuzzy Logic» more  EUSFLAT 2007»
15 years 2 months ago
Mixed Integer Programming, General Concept Inclusions and Fuzzy Description Logics
Fuzzy Description Logics (fuzzy DLs) have been proposed as a language to describe structured knowledge with vague concepts. In [23], a solution based on Mixed Integer Linear Progr...
Umberto Straccia, Fernando Bobillo
GG
2008
Springer
15 years 2 months ago
Transformation-Based Operationalization of Graph Languages
Graph Languages1 emerged during the seventies from the necessity to process data structures with complex interrelations. Nowadays, various variants of these languages can be found...
Erhard Weinell
PLDI
2012
ACM
13 years 3 months ago
Concurrent data representation synthesis
We describe an approach for synthesizing data representations for concurrent programs. Our compiler takes as input a program written using concurrent relations and synthesizes a r...
Peter Hawkins, Alex Aiken, Kathleen Fisher, Martin...
ALGORITHMICA
2010
95views more  ALGORITHMICA 2010»
15 years 1 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
ARSCOM
2007
82views more  ARSCOM 2007»
15 years 1 months ago
Extremal properties of (1, f)-odd factors in graphs
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
Qinglin Roger Yu, Zhao Zhang