1511 search results - page 128 / 303 » Hierarchical Graph Transformation |
119
click to vote
IH
2007
Springer
15 years 11 months ago
2007
Springer
We present a probabilistic program-transformation algorithm to render a given program tamper-resistant. In addition, we suggest a model to estimate the required effort for an atta...
137
click to vote
KR
1994
Springer
15 years 9 months ago
1994
Springer
Probabilistic AI planning methods that minimize expected execution cost have a neutral attitude towards risk. We demonstrate how one can transform planning problems for risk-sensi...
146
click to vote
CVPR
2007
IEEE
16 years 7 months ago
2007
IEEE
Many vision tasks are posed as either graph partitioning (coloring) or graph matching (correspondence) problems. The former include segmentation and grouping, and the latter inclu...
159
click to vote
CASES
2010
ACM
15 years 1 months ago
2010
ACM
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...
158
click to vote
IPPS
1999
IEEE
15 years 9 months ago
1999
IEEE
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...