4913 search results - page 98 / 983 » Results and Perspectives of the G |
PEPM
2012
ACM
12 years 5 months ago
2012
ACM
We share a vision of connecting the topics of bidirectional transformation and inductive program synthesis, by proposing to use the latter in approaching problematic aspects of th...
APPML
2008
13 years 10 months ago
2008
The following fundamental result for the domination number (G) of a graph G was proved by Alon and Spencer, Arnautov, Lov
ICDT
2009
ACM
14 years 11 months ago
2009
ACM
Schema mappings are declarative specifications that describe the relationship between two database schemas. In recent years, there has been an extensive study of schema mappings a...
SODA
2010
ACM
14 years 7 months ago
2010
ACM
There has been great interest in deciding whether a combinatorial structure satisfies some property, or in estimating the value of some numerical function associated with this com...
ICDM
2007
IEEE
14 years 4 months ago
2007
IEEE
Typical clustering algorithms output a single clustering of the data. However, in real world applications, data can often be interpreted in many different ways; data can have diff...