Sciweavers

1357 search results - page 115 / 272
» Compositionality in Graph Transformation
Sort
View
145
Voted
CASES
2010
ACM
15 years 8 days ago
Optimizing energy to minimize errors in dataflow graphs using approximate adders
Approximate arithmetic is a promising, new approach to lowenergy designs while tackling reliability issues. We present a method to optimally distribute a given energy budget among...
Zvi M. Kedem, Vincent John Mooney, Kirthi Krishna ...
80
Voted
BIRTHDAY
2009
Springer
15 years 10 months ago
Properly Coloured Cycles and Paths: Results and Open Problems
In this paper, we consider a number of results and six conjectures on properly coloured (PC) paths and cycles in edge-coloured multigraphs. We overview some known results and prov...
Gregory Gutin, Eun Jung Kim
125
Voted
ICALP
2004
Springer
15 years 9 months ago
Simple Permutations Mix Well
We study the random composition of a small family of O(n3 ) simple permutations on {0, 1}n . Specifically we ask what is the number of compositions needed to achieve a permutatio...
Shlomo Hoory, Avner Magen, Steven Myers, Charles R...
114
Voted
JSW
2008
167views more  JSW 2008»
15 years 3 months ago
An Approach to Discover Dependencies between Service Operations
Service composition is emerging as an important paradigm for constructing distributed applications by combining and reusing independently developed component services. One key issu...
Shuying Yan, Jing Wang 0002, Chen Liu, Lei Liu
EDBT
2009
ACM
98views Database» more  EDBT 2009»
15 years 10 months ago
A runtime approach to model-independent schema and data translation
A runtime approach to model-generic translation of schema and data is proposed. It is based on our previous work on MIDST, a platform conceived to perform translations in an off-...
Paolo Atzeni, Luigi Bellomarini, Francesca Bugiott...