## For more information about Current Contents on Diskette”’, telephone toll-free 800-336-4474. Outside the US and Canada, call 215-386-0100, ext. 1483, or contact the nearest ISI@ representative listed on the inside front cover of thk issue of Current Conte (1998)

### Cached

### Download Links

Venue: | Proceedings of TACAS’98 |

Citations: | 2 - 0 self |

### BibTeX

@INPROCEEDINGS{Goos98formore,

author = {Gerhard Goos and Juris Hartmanis and Jan Van Leeuwen and Editorial Board and David Hutchison and Takeo Kanade and Jon M. Kleinberg and Friedemann Mattern and John C. Mitchell and C. Pandu Rangan and Bernhard Steffen and Demetri Terzopoulos and Doug Tygar and Moshe Y. Vardi and Gerhard Weikum and Meersman Tari and Herrero Méndez Cavedon and Martin Hinze and Buchanan Pérez Robles and Humble Albani and Dietz Panetto Scannapieco and Halpin Spyns and Zaha Zimányi Stefanakis and Dillon Feng and Jarrar Lehmann and Robert Meersman and Zahir Tari and Pilar Herrero},

title = {For more information about Current Contents on Diskette”’, telephone toll-free 800-336-4474. Outside the US and Canada, call 215-386-0100, ext. 1483, or contact the nearest ISI@ representative listed on the inside front cover of thk issue of Current Conte},

booktitle = {Proceedings of TACAS’98},

year = {1998},

pages = {68--84},

publisher = {Springer Verlag}

}

### OpenURL

### Abstract

Proceedings

### Citations

3088 | Snakes: Active Contour Models
- Kass, Witkin, et al.
- 1988
(Show Context)
Citation Context ...n both synthetic and real images. Keywords: Topological Active Nets, Genetic Algorithms, Hybrid Optimization Algorithms, Lamarckian Strategy. 1 Introduction Deformable models, proposed by Kass et al. =-=[8]-=- in 1988, are well-known tools for image segmentation. The active nets model was proposed by Tsumiyama and Yamamoto [10] as a variant of the deformable models that integrates features of region–based ... |

1999 | The Anatomy of the Grid: Enabling Scalable Virtual Organizations
- Foster, Kesselman, et al.
(Show Context)
Citation Context ...forms, computational clusters and grids have gained tremendous popularity in computation science [9]. Grid computing enables the development of large scientific applications on an unprecedented scale =-=[10]-=-. Grid-aware applications, also called metaapplications or multidisciplinary applications use coupled computational recourses R. Meersman et al. (Eds.): OTM Workshops 2005, LNCS 3762, pp. 357 – 366, 2... |

1818 |
Genetic algorithm in search, optimization, and machine learning
- Goldberg
- 1989
(Show Context)
Citation Context ...ension of the original active net model that solves some intrinsic problems to the deformable models such as the initialization problem. In the field of deformable models, the Genetic Algorithms (GA) =-=[6]-=- have mainly been used for edge or surface extraction [2,5,9]. Also, Tohka [9] have developed a hybrid approach since he has used a greedy algorithm to strengthen the minimum obtained by a global GA m... |

1593 | Globus: A Metacomputing Infrastructure Toolkit
- Foster, Kesselman
- 1997
(Show Context)
Citation Context ... for such issues as authentication/security, information, resource access, data management, etc [13]. Many middleware packages [14], [15], [16], [17] were implemented by many teams among which Globus =-=[18]-=- is the most widely known. However, experiments with large configurations and real applications have shown that the latency of wide area networks is prohibitively high and that substantial bandwidth c... |

1444 | A note on two problems in connexion with graphs,” Numerische mathematik
- Dijkstra
- 1959
(Show Context)
Citation Context ... algorithms. It is known that it is not possible for a nonclairvoyant algorithm to beO(1)-competitive with respect to average flow time [11], although nonclairvoyant algorithms can be log competitive =-=[8,3]-=-, and can be O(1)-speed O(1)-competitive [4,6,7]. 2 Preliminaries An instance consists of n jobs J1,...,Jn, where job Ji has a non-negative integer release time ri, and a positive integer processing t... |

635 | LEDA: a platform for combinatorial and geometric computing
- Mehlhorn, aher
- 1995
(Show Context)
Citation Context ...sed by Balinski [4]. We contribute to this vein by shedding new light on two existing UFL algorithms, the primal-dual algorithm of Jain & Vazirani (JV) [15], and the algorithm of Mettu & Plaxton (MP) =-=[21]-=-. ⋆ Supported by the Fannie and John Hertz Foundation and by NSF grant CCR-0113371. ⋆⋆ Research partially supported by NSF grant CCR-9912422. ⋆⋆⋆ Research partially supported by NSF grant CCR-9912422.... |

577 |
Fibonacci heaps and their uses in improved network optimization problems
- Fredman, Tarjan
- 1987
(Show Context)
Citation Context ...We note that an optimum vertex solution only uses |V | non-zero variables xH. With potentially exponential number of columns, it is not surprising the following theorem, whose proof uses an idea from =-=[4]-=- and is ommited due to space limitations, holds: Theorem 4. Even in the special case when all the nodes have the same battery supply, the Network Lifetime for Symmetric Connectivity (or Broadcast or S... |

472 | Condor-G: A Computation Management Agent for Multi-Institutional Grids
- Frey, Tannenbaum, et al.
(Show Context)
Citation Context ...d that a number of basic middleware services must be provided for such issues as authentication/security, information, resource access, data management, etc [13]. Many middleware packages [14], [15], =-=[16]-=-, [17] were implemented by many teams among which Globus [18] is the most widely known. However, experiments with large configurations and real applications have shown that the latency of wide area ne... |

368 |
Neural Networks
- Haykin
- 1994
(Show Context)
Citation Context ... difficult nonlinear systems. They represent a very good alternative to traditional methods for solving complex problems in many fields, including image processing, pattern recognition, robotics, etc =-=[1]-=-. However, most artificial neural network models require high computational load, especially in the training phase (up to days and weeks). This is, indeed, the main obstacle in front of an efficient u... |

232 | I.: MPICH-G2: A Grid-Enabled Implementation of the Message Passing Interface. Parallel and Distributed Computing 63
- Karonis, Toonen, et al.
- 2003
(Show Context)
Citation Context ... a number of basic middleware services must be provided for such issues as authentication/security, information, resource access, data management, etc [13]. Many middleware packages [14], [15], [16], =-=[17]-=- were implemented by many teams among which Globus [18] is the most widely known. However, experiments with large configurations and real applications have shown that the latency of wide area networks... |

173 | Smallest enclosing disks (balls and ellipsoids), in: New Results and New Trends
- Welzl
- 1991
(Show Context)
Citation Context ... presentation of practical requirements that the PESP is able to meet, we refer to Krista[12]. The feasibility problem has been shown to be NP-complete, by reductions from Hamiltonian Cycle ([23] and =-=[18]-=-) or Coloring ([20]). The minimization problem with a linear objective has been shown to be NP-hard by a reduction from Linear Ordering ([16]). We want to solve PESP instances by using the mixed integ... |

156 |
Efficient algorithms for shortest paths in sparse networks
- Johnson
- 1977
(Show Context)
Citation Context ...cy can lead to awrongoutput. A second approach besides using floating point arithmetic is to use exact algebraic computation methods like the use of the gap theorem [4] ormultivariate Sturm sequences =-=[16]-=-. Then of course the results are correct, butthe algorithms in general are very slow. We consider arrangements of non-singular curves in the real plane defined by rational polynomials. Although the no... |

112 | Solving geometric problems with the rotating calipers
- Toussaint
- 1983
(Show Context)
Citation Context ...ection can be as well. Smallest Enclosing Rectangle. If we allow a rectangle to beoriented in any direction and search for one with smallest area, things are not as simple anymore. The algorithm from =-=[19]-=- finds it in linear time. However, due to numerical inconsistencies we had to incorporate additional tests to assure that all points areinfact inside the rectangle. As for the minimal enclosingGeomet... |

91 | onherr. On the Design of CGAL, the Computational Geometry Algorithms Library. Research Report MPI-I-1-98, Max-Planck-Institut f ur Informatik, Saarbr ucken
- Fabri, Giezeman, et al.
- 1998
(Show Context)
Citation Context ...es a detailed study of planar Nef polyhedra; his implementation is available in Cgal. Other approaches to non-manifold geometric modeling are due to Rossignac and O’Connor [24], Weiler [31], Karasick =-=[17]-=-, Gursoz, Choi, and Prinz [13], and Fortune [12]. Rossignac and O’Connor describe modeling by so-called selective geometric complexes. The underlying geometry is based on algebraic varieties. The corr... |

71 | Equational term graph rewriting - Ariola, Klop - 1996 |

60 | Shortest Path Algorithms: An Evaluation using Real Road Networks
- Zhan, Noon
- 1998
(Show Context)
Citation Context ...eve the competitive ratio of 2. The loss of an algorithm is analyzed in [8], where they present an algorithm with competitive ratio better than 2 for the case of two and exponential packet values. In =-=[9]-=- they study the case of two packet values and present a 1.3-competitive algorithm. The problem of whether the competitive ratio of 2 of the natural greedy algorithm can be improved has been open for a... |

55 | K.Weihe, “Dijkstra’s algorithm on-line: An empirical case study from public railroad transport
- Schulz
(Show Context)
Citation Context ...n [10]. This technique achieves constant proof size and verification time and provides a tradeoff between the query and update times. For example, one can achieve O( √ n)querytime and update time. In =-=[1]-=-, the notion of a persistent authenticated dictionary is introduced, where the user can issue historical queries ofthe type“waselement e in set S attime t”. Afirst step towards the design of more gene... |

49 | Design and evolution of modular neural network architectures. Neural Networks
- Happel, Murre
- 1994
(Show Context)
Citation Context ...h sensor and data acquisition channel. Therefore the dimension of the real problem could be in 10 4 times greater than the case described in this paper. We have used a modular neural network approach =-=[27]-=-, which allows dividing a large problem into smaller tasks and fulfilling them by separate simple models of neural networks with the results reducing in the end of the whole algorithm. In our case we ... |

49 | Undirected Single Source Shortest Paths in Linear Time
- Thorup
- 1997
(Show Context)
Citation Context ...stable distributions to improve the space requirements. 3.1 Stable Distributions Indyk pioneered the use of Stable Distributions in data streams and since then have received a great deal of attention =-=[17,5,4,16]-=-. Throughout our discussion of distributions, we shall use ∼ for the equivalence relation meaning “is equivalent in distribution to”. A stable distribution is defined by four parameters. These are (i)... |

43 |
Path Computation Algorithms for Advanced Traveler Information System
- Shekhar, Kohli, et al.
- 1993
(Show Context)
Citation Context ...on details. Seel [27,28] gives a detailed study of planar Nef polyhedra; his implementation is available in Cgal. Other approaches to non-manifold geometric modeling are due to Rossignac and O’Connor =-=[24]-=-, Weiler [31], Karasick [17], Gursoz, Choi, and Prinz [13], and Fortune [12]. Rossignac and O’Connor describe modeling by so-called selective geometric complexes. The underlying geometry is based on a... |

41 | A computational study of routing algorithms for realistic transportation networks - Jacob, Marathe, et al. |

38 | J.W.: Lambda calculus with explicit recursion - Ariola, Klop - 1997 |

34 | A simple shortest path algorithm with linear average time, in
- Goldberg
(Show Context)
Citation Context ... bound on the label length for distance labeling on interval graphs, we can apply Lemma 4 with I(n). However, computing I(n) is an unsolved graph-enumeration problem. Cohen, Komlós and Muller gave in =-=[7]-=- the probability p(n, m) that a labeled n-vertex m-edge random graph is an interval graph under conditions on m. Theyhavecomputed p(n, m) for m<4, and showed that p(n, m) =exp ( −32c6 /3 ) , where lim... |

28 |
On active contour models and ballons
- Cohen
- 1991
(Show Context)
Citation Context ...o external after a link cut is only considered as external for fitness computation when it is over the object edges. Also, a balloon pressure is used in order to move these nodes towards the contours =-=[4]-=-. The topological changes force the crossover between nets with the same topology in order to avoid crossings in the connections of the resulting nets. This fact implies a population categorization. E... |

28 | Single-source shortest-paths on arbitrary directed graphs in linear average-case time
- Meyer
- 2001
(Show Context)
Citation Context ...ani [13] give an approximate Max-Flow Min-Cut theorem and an algorithm with aconstant approximation ratio. For trees, Garg, Vazirani and Yannakakis give an algorithm with anapproximation ratio of two =-=[6]-=-. 1.5 Structure of This Paper In section 2 we give notations and definitions, in section 3 we prove approximation results, and in section 4 we establish the equivalence of the multicut and correlation... |

27 |
Vries. Infinitary lambda calculus
- Kennaway, Klop, et al.
- 1997
(Show Context)
Citation Context ...oc. of the 6th International Conference on Rewriting Techniques and Applications (RTA’95), volume 914 of Lecture Notes in Computer Science, pages 257–270. Springer, 1995. Extended version appeared as =-=[87]-=-. 78. J.R. Kennaway, J.W. Klop, M.R. Sleep, and F.J. de Vries. Transfinite reductions in orthogonal term rewriting systems. Information and Computation, 119(1):18–38, 1995. Extended version of [59].sX... |

23 |
Hiti graph model of topographical roadmaps in navigation systems
- Jung, Pramanik
- 1996
(Show Context)
Citation Context ...and thus efficiently solved. The relation between consecutiveonesinrows matrices and flow, and, moreover, the relation of these matrices shortest and longest path problems on DAGs were first given in =-=[27]-=-. In [15] optimizationproblemsonc1 matrices (on columns) are studied. The only paper that, to our knowledge, deals exactly with MSD is [24]. In Section 4, we will compare our heuristics in detail to t... |

22 |
Termination for direct sums of left-linear complete term rewriting systems
- Toyama, Klop, et al.
(Show Context)
Citation Context ...oc. of the 3rd International Conference on Rewriting Techniques and Applications (RTA’89), volume 355 of Lecture Notes in Computer Science, pages 477–491. Springer, 1989. Extended version appeared as =-=[79]-=-. 53. J.C.M. Baeten and J.W. Klop, editors. Proc. of the 1st International Conference on Theories of Concurrency: Unification and Extension (CONCUR’90), volume 458 of Lecture Notes in Computer Science... |

22 |
Using multi-level graphs for timetable information
- Schulz, Weihe
- 2002
(Show Context)
Citation Context ...emands [1,Bj] for j =1,...,t overlaps with eachofthe demands [0,Ai] for i =1,...,t the demands [1,Bj] for j =1,...,t must get colors from C2. Sincethere are at most 2t 2 +3t + 2 links in the interval =-=[2, 11]-=- and there are only 3 color classes, the cost contribution of the links in this interval is at most 3(2t 2 +3t +2). Each ofthe the links in the interval [2, 8] has a load of 2t 2 = |C1| + |C2| + |C3| ... |

21 |
Time depending shortest-path problems with applications to railway networks
- Nachtigall
- 1995
(Show Context)
Citation Context ...dition to interpolation search. Their study was started with the works of [6, 8] for insertions and deletions performed according to the uniform distribution, and continued by Mehlhorn and Tsakalidis =-=[13]-=-, and Andersson and Mattsson [1] for μ-random insertions and random deletions, where μ is a so-called smooth density. An insertion is μ-random if the key to be inserted is drawn randomly with density ... |

21 |
Pareto shortest paths is often feasible in practice
- Muller-Hannemann, Weihe
(Show Context)
Citation Context ...mented as a q ∗ -heap [18]. The top level data structureisastatic interpolation search tree that stores all elements. Our data structureismaintained by incrementally performing global reconstructions =-=[14]-=-. More precisely, let S0 be the set of stored elements atthe latest reconstruction, and assume that S0 = {x1,... ,xn0} in sorted order. The reconstruction is performed as follows. We partition S0 into... |

16 | Comparing curried and uncurried rewriting - Kennaway, Klop, et al. - 1996 |

16 | Classical and contemporary shortest path problems in road networks: Implementation and experimental analysis of the TRANSIMS router
- BARRETT, BISSET, et al.
- 2002
(Show Context)
Citation Context ...ved internal-memory SSSP-algorithms have been proposed for bounded integer/float weights or bounded ratio W/w, wherew ∈ R + and W ∈ R + are the minimal and maximal edge weights inG, respectively; see =-=[11, 12]-=- for an overview. For W/w = 1, SSSP becomes breadth-first search (BFS). A simple extension of the first o(V )-I/O algorithm for undirected BFS [9] yields an SSSP-algorithm that performs O( √ VEW/B+ W ... |

15 |
Minimal enclosing parallelogram with application
- Schwarz, Teich, et al.
- 1995
(Show Context)
Citation Context ...r also provides an empirical analysis of the performance of the system in various deployment scenarios. The authentication of distributed data using web services and XML signatures is investigated in =-=[20]-=-. Prooflets, a scalable architecture for authenticating web content based on authenticated dictionaries, are introduced in [21]. Work related to authenticated data structures includes [3,4,8,14,15]. A... |

14 |
Transputers and Neural Networks: An Analysis of Implementation Constraints and Performance
- Murre
- 1993
(Show Context)
Citation Context ...arallel nature of artificial neural networks, many researchers have already focused their attention on the parallelization of different neural networks on several parallel systems [2], [3], [4], [5], =-=[6]-=-. However, there are still several bottlenecks for mapping neural networks onto the processors of the parallel machines [7], [8]. Among available today high-performance and distributed computing platf... |

13 |
A comparison between label-setting and label-correcting algorithms for computing one-to-one shortest paths
- Zahn, Noon
(Show Context)
Citation Context ...son and Woll by exposing a constant that depends on q and on the contention of the list. Wethen combine our lower bound with a lower bound on contention of permutations given by Lovász [11] and Knuth =-=[10]-=-, to showthat for any ɛ>0, work of any instance must be at least n1+(1−ɛ)√2lnlnn/ ln n , for any large enough n (appearing in Theorem 1). The resulting bound is nearly optimal, as demonstrated by our ... |

12 | Use of alphastable self-similar stochastic processes for modeling traffic in broadband networks - Gallardo, Makrakis, et al. - 2000 |

12 | Notes on partial combinatory algebras - Bethke - 1988 |

12 | Experimental evaluation of a new shortest path algorithm
- Pettie, Ramachandran, et al.
- 2002
(Show Context)
Citation Context ... presence of outliers, essentially reduces to the computation of the shortest vertical segment that stabs at least k hyperplanes. See [12] for the details. However, the results of Erickson and Seidel =-=[9,8]-=- imply that approximating the shortest vertical segment that stabs d +1hyperplanestakes Ω(n d ) time, under a reasonable computation model, thus implying that this approach is probably bound to fail i... |

12 |
An integrated traffic information system
- Preuss, Syrbe
- 1997
(Show Context)
Citation Context ...in part by ONR grant N00014-98-1-0589. G. Di Battista and U. Zwick (Eds.): ESA 2003, LNCS 2832, pp. 409–421, 2003. c○ Springer-Verlag Berlin Heidelberg 2003410 M. Mahdian and M. Pál for a survey and =-=[15,16]-=- for the latest results). However, LP based techniques have not been successful when dealing with hard capacities, and all known LP formulations have an unbounded integrality gap. Using local search, ... |

11 | Confluent rewriting of bisimilar term graphs - Ariola, Klop, et al. - 1997 |

10 |
Grid programming: some indications where we are headed
- Laforenza
(Show Context)
Citation Context ...lberg 2005s358 V. Turchenko that are not available at a single site. Grid technology lets scientists solve larger or new problems by pooling together resources that could not be coupled easily before =-=[11]-=-, [12]. In order to enable grid computing, it has been recognized that a number of basic middleware services must be provided for such issues as authentication/security, information, resource access, ... |

10 | Oostrom. Vicious circles in orthogonal term rewriting systems - Ketema, Klop, et al. - 2005 |

9 |
Volumetric Segmentation of Brain Images Using Parallel Genetic Algorithm
- Fan, Jiang, et al.
- 2002
(Show Context)
Citation Context ...intrinsic problems to the deformable models such as the initialization problem. In the field of deformable models, the Genetic Algorithms (GA) [6] have mainly been used for edge or surface extraction =-=[2,5,9]-=-. Also, Tohka [9] have developed a hybrid approach since he has used a greedy algorithm to strengthen the minimum obtained by a global GA minimization process. GAs have some advantages in the active m... |

8 | CuPit-2: A portable parallel programming language for artificial neural networks
- Hopp, Prechelt
- 1997
(Show Context)
Citation Context ...en proposed in the literature [5]: according to the architecture of the network, taking advantage of the matrix learning rule calculations [28], or parallelizing the presentation of examples [29]. In =-=[30]-=-, three nested levels of parallelism in neural algorithms have been considered: connection parallelism (parallel execution on sets of weights), node parallelism (parallel execution of operations on se... |

8 | Descendants and origins in term rewriting - Bethke, Klop, et al. - 2000 |

6 |
Efficient metacomputing of elliptic linear and non-linear problems
- Barberou, Garbey, et al.
- 2003
(Show Context)
Citation Context ...2005s358 V. Turchenko that are not available at a single site. Grid technology lets scientists solve larger or new problems by pooling together resources that could not be coupled easily before [11], =-=[12]-=-. In order to enable grid computing, it has been recognized that a number of basic middleware services must be provided for such issues as authentication/security, information, resource access, data m... |

6 |
ZENTURIO: A Grid Middleware-based Tool for Experiment Management of Parallel and Distributed Applications
- Prodan, Fahringer
- 2004
(Show Context)
Citation Context ...ognized that a number of basic middleware services must be provided for such issues as authentication/security, information, resource access, data management, etc [13]. Many middleware packages [14], =-=[15]-=-, [16], [17] were implemented by many teams among which Globus [18] is the most widely known. However, experiments with large configurations and real applications have shown that the latency of wide a... |

6 | Global optimization of deformable surface meshes based on genetic algorithms
- Tohka
- 2001
(Show Context)
Citation Context ...intrinsic problems to the deformable models such as the initialization problem. In the field of deformable models, the Genetic Algorithms (GA) [6] have mainly been used for edge or surface extraction =-=[2,5,9]-=-. Also, Tohka [9] have developed a hybrid approach since he has used a greedy algorithm to strengthen the minimum obtained by a global GA minimization process. GAs have some advantages in the active m... |

6 |
Active net : Active net model for region extraction
- Tsumiyama, Sakaue, et al.
- 1989
(Show Context)
Citation Context ..., Lamarckian Strategy. 1 Introduction Deformable models, proposed by Kass et al. [8] in 1988, are well-known tools for image segmentation. The active nets model was proposed by Tsumiyama and Yamamoto =-=[10]-=- as a variant of the deformable models that integrates features of region–based and boundary–based segmentation techniques. The Topological Active Net (TAN) model [1] was developed as an extension of ... |