A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is `application/pdf`

.

## Filters

##
###
A Region Graph Based Approach to Termination Proofs
[chapter]

2006
*
Lecture Notes in Computer Science
*

While most of the recent work on automated

doi:10.1007/11691372_21
fatcat:csq2btrctzbjheo2i7hyx7kjue
*termination**proofs*focuses on the construction of linear ranking functions, we develop an*approach**based*on*region**graphs*in which*regions*define subsets of variable ... We show the effectiveness of our*proof*method by experiments with Java code using*a*prototype implementation of our*approach*. ... The basic idea of our*region**graph**based**termination**proofs*is stated in Theorem 1. In the next sections we will show how*to*construct*region**graphs*for proving*termination*. ...##
###
An exact algorithm for the construction of rectilinear Steiner minimum trees among complex obstacles

2011
*
Proceedings of the 48th Design Automation Conference on - DAC '11
*

This is the first work

doi:10.1145/2024724.2024762
dblp:conf/dac/HuangY11
fatcat:wyqfat4mxbfllhjn37euajxh4a
*to*propose*a*geometric*approach**to*optimally solve the OARSMT problem among complex obstacles. ... Benchmarks with hundreds of*terminals*among*a*large number of obstacles are solved optimally in*a*reasonable amount of time. ... Although the escape*graph*model can transform the OARSMT problem*to**a**graph*problem which can be solved optimally by using some*graph**based*algorithms [12, 13] , these*approaches*are believed*to*be less ...##
###
Analogical Representation of RCC-8 for Neighborhood-Based Qualitative Spatial Reasoning
[chapter]

2015
*
Lecture Notes in Computer Science
*

We develop

doi:10.1007/978-3-319-24489-1_15
fatcat:evfxocp5hrg63lfjnkytgq4hv4
*a*graphbased analogical representation for RCC-8, the construction of which is*based*on neighborhood transitions realized by efficient*graph*transformations. ... This makes it difficult*to*design efficient knowledge manipulation techniques that consistently advance*a*representation with respect*to*conceptual neighborhood. ... The condition of the "while" loop implies that the algorithm can only*terminate*with*a**graph*G whose RCC-8 interpretation is identical*to*C. It remains*to*be shown that the algorithm*terminates*. ...##
###
Network coding for undirected information exchange

2009
*
IEEE Communications Letters
*

We consider the information exchange problem where each in

doi:10.1109/lcomm.2009.081288
fatcat:tbcx5et3pve4zpd62hd4hdkjtq
*a*set of*terminals*transmits information*to*all other*terminals*in the set, over an undirected network. ... We show that the design of only*a*single network code for multicasting is sufficient*to*achieve an arbitrary point in the achievable rate*region*. ... We also provide*a**proof*for Theorem 2*based*on*graph*-theoretic properties, that gives additional insight in our problem structure. VII. ...##
###
EBOARST: An Efficient Edge-Based Obstacle-Avoiding Rectilinear Steiner Tree Construction Algorithm

2008
*
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
*

Second, we present

doi:10.1109/tcad.2008.2006098
fatcat:inxgblkcpbelpcw7s7g5cowcfa
*a*fast algorithm for the minimum*terminal*spanning tree construction step, which dominates the running time of several existing*approaches*. ... Third, we present an edge-*based*heuristic, which enables us*to*perform both local and global refinements, leading*to*Steiner trees with small lengths. ...*Proof*: For*a*given G fb , we construct*a**graph*G fb whose vertex set contains only the*terminal*vertices of G fb . ...##
###
Page 3267 of Mathematical Reviews Vol. , Issue 87f
[page]

1987
*
Mathematical Reviews
*

*A*theorem is proved which may be used

*to*establish the confluence of

*a*

*terminating*rewrite system. ... We present an

*approach*

*to*generalizing the Tarskian semantics of Horn clause rules

*to*justify

*a*form of quantitative deduction. Each clause receives

*a*numerical attenuation factor. ...

##
###
On the Construction of Optimal Obstacle-Avoiding Rectilinear Steiner Minimum Trees

2011
*
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
*

*Based*on these observations,

*a*twophase

*approach*is developed for the construction of OARSMTs. In the first phase, we generate

*a*set of FSTs with blockages. ... We modify and extend the algorithm

*to*allow obstacles in the routing

*region*. For each routing obstacle, we first introduce four virtual

*terminals*located at its four corners. ... Let (W : N − W) be

*a*source

*to*

*terminal*cut of G such that c(W) is minimized, then X m = {u : u ∈ T + V ∧ u ∈ N − W} is

*a*minimum of f (X). ...

##
###
Page 1949 of Mathematical Reviews Vol. 55, Issue 6
[page]

1978
*
Mathematical Reviews
*

Authors’ summary: ‘“‘

*A*new*proof*for the*terminal*solvability of multiterminal RLCT networks is given. ... Generalization*to*an arbitrarily finite number of decoders follows directly. | Nguyen Quang Duc (Melbourne) Abdullah, Khaldun; Tokad, Yilmaz; Zeren, Togan 14414*A*new*approach*for the*terminal*solvability ...##
###
Page 3626 of Mathematical Reviews Vol. , Issue 2000e
[page]

2000
*
Mathematical Reviews
*

*A*bottom-up algorithm for p-subgraph isomorphism computation according

*to*

*a*given search

*graph*and

*a*template

*graph*is described. ... Summary: “An

*approach*

*to*the recognition of polymorphic pat- terns by subgraph isomorphism computation of parameterized

*graphs*is presented. ...

##
###
Reduction-based exact solution of prize-collecting Steiner tree problems
[article]

2018
*
arXiv
*
pre-print

The prize-collecting Steiner tree problem PCSTP is

arXiv:1811.09068v1
fatcat:irnwe4d6nvhjbmpzbt6ivfbrui
*a*well-known generalization of the classical Steiner tree problem in*graphs*, with*a*large number of practical applications. ... Finally, the new developments also translate into*a*strong computational performance: the resulting exact solver outperforms all previous*approaches*---both in terms of run-time and solvability---and can ... In turn, an improved upper bound can allow for further*graph*reductions (e.g. by the*terminal*-*regions*composition) or*to*fix additional*terminals*(by means of Proposition 6). ...##
###
Range Assignment Problem on the Steiner Tree Based Topology in Ad Hoc Wireless Networks

2009
*
Mobile Information Systems
*

It does not assume that communication

doi:10.1155/2009/707968
fatcat:ubyf7o4fmngjdnqgqjeeanbgjm
*graph**to*be*a*unit disk*graph*. ... The output of the algorithm is the minimal Steiner tree on the*graph*consists of*terminal*(original) nodes and relay (additional) nodes. ... The*region*of*a*point n i ∈ N consists of all points closer*to*n i than*to*any other points on the plane. ...##
###
From Shape Analysis to Termination Analysis in Linear Time
[chapter]

2016
*
Lecture Notes in Computer Science
*

We present

doi:10.1007/978-3-319-41528-4_23
fatcat:hhr5skypnnabhkutmxoxbnpkxi
*a*novel algorithm*to*conservatively check whether*a*(recursive) heap-manipulating program*terminates*. ... We successfully applied*a*prototype of our analysis*to*prove*termination*of*a*suite of benchmarks from existing literature, including (looping, recursive, and concurrent) list manipulating programs, looping ... We refer*to*the resulting*graph*as the condensation*graph*and*to*its nodes as*region*ranks, and denote the*region*rank corresponding*to**a**region*r by [r] . ...##
###
Recognition of logically related regions based heap abstraction

2012
*
Journal of the Egyptian Mathematical Society
*

The result of heap abstraction, together with some properties of data structures, can be used

doi:10.1016/j.joems.2012.08.009
fatcat:nfz6sf4ya5d37hveda4y3s3ndm
*to*enable program optimizations like static deallocation, pool allocation,*region*-*based*garbage collection, ... More precisely, this paper proposes algorithms for abstracting heap components with the layout of*a*singly linked list,*a*binary tree,*a*cycle, and*a*directed acyclic*graph*. ... The simplest of these*approaches*groups the heap objects*based*on the result of*a*pointer analysis like Steensgaard analysis [7] . ...##
###
Key Generation Algorithms for Pairwise Independent Networks Based on Graphical Models

2015
*
IEEE Transactions on Information Theory
*

In particular, in the first problem in which one is required

doi:10.1109/tit.2015.2450729
fatcat:y6ax4fsmorgfzggaj2bs7hboza
*to*generate*a*group key for*a*group of users in the network, we propose*a*network coding*based*global key propagation*approach*. ... In the second problem, in which one is required*to*generate multiple keys simultaneously for different pairs of users, we propose*a*multi-commodity flow*based*global key propagation*approach*. ... In the following, we describe*a**graph*-*based**approach*that allows nodes*to*propagate keys over the network. ...##
###
Partial dead code elimination using slicing transformations

1997
*
Proceedings of the ACM SIGPLAN 1997 conference on Programming language design and implementation - PLDI '97
*

These branches are eliminated in

doi:10.1145/258915.258930
dblp:conf/pldi/BodikG97
fatcat:omdrzyx6ijhw5j2ea4jdzrbqfe
*a*branch deletion step*based*upon code duplication. ... The control ow restructuring performed*to*achieve predication is expressed through slicing transformations. This*approach*achieves PDE that is not realizable by existing algorithms. ... Acknowledgment This research has been supported in part by*a*National Science Foundation Presidential Young Investigator Award CCR-9157371*to*the University of Pittsburgh and*a*grant from Hewlett-Packard ...
« Previous

*Showing results 1 — 15 out of 63,048 results*