A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
Filters
Foreword guest editor
2013
UTMS Journal of Economics
Preserved Fulltext
Guest Editors' Foreword
2020
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In the remainder of this foreword we briefly introduce all papers, arranging them into broad topics. ...
In the remainder of this foreword we briefly introduce all papers, arranging them into broad topics. ...
doi:10.1007/s00454-020-00212-0
fatcat:c7rkm2wq4vax7kdvpn7urjbl7e
Guest Editors' Foreword
2009
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Guest Editors' Foreword
2017
Algorithmica
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The 26th International Symposium on Algorithms and Computation (ISAAC 2015) was held in Nagoya, Japan, December 9-11, 2015. The program committee received 180 high-quality submissions, and 65 were accepted for presentation. This special issue gathers a selection of five of these accepted papers, which went through the standard refereeing process of Algorithmica. In the paper by Aline Saettler, Eduardo Laber and Ferdinando Cicalese, the authors characterize the best possible trade-off achievable
doi:10.1007/s00453-017-0359-4
fatcat:6lsb36pafvhutk6ctmvqdakzke
more »
... when optimizing the construction of a decision tree with respect to both the worst and the expected costs, given a probability distribution on the input. For every ρ > 0, they show that there is a decision tree with worst-case cost of at most (1 + ρ)OPT W + 1 and expected cost at most 1/(1 − e −ρ )OPT E , where OPT W and OPT E denote respectively the minimum worst-case cost and the minimum expected cost of a decision tree for the given instance. They also present an infinite family of instances for which this is essentially the best possible trade-off. The paper by Sumedh Tirodkar and Sundar Vishwanathan is on the approximability of the minimum rainbow subgraph (MRS) problem, which has applications in computational biology. Given an n-vertex edge-colored undirected graph, the goal is to find a subgraph on a minimum number of vertices which has one induced edge of each color. By considering a colored version of the well-known k-densest subgraph B Khaled Elbassioni
Guest Editors' Foreword
2001
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
The editors of this collection have been fortunate to know Micha well. We have been strongly influenced by his work and his mathematical philosophy. ...
doi:10.1007/s00545-001-0012-4
fatcat:e622cmrja5ctrhckvolemlkf6i
Guest editors foreword
2009
Bulletin of the New Zealand Society for Earthquake Engineering
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
We are grateful to the Editor of the New Zealand Society for Earthquake Engineering Bulletin for providing this opportunity to compile this special issue on earthquake geotechnical engineering (EGE). ...
Guest Editors, Misko Cubrinovski Michael Pender University of Canterbury University of Auckland January 2009 (i) ...
The editors also wish to acknowledge the special support provided by the Earthquake Commission towards the cost of running the workshop in November 2006. ...
doi:10.5459/bnzsee.42.1.i
fatcat:ziv3dzlsgvhqrgoo7ti36rgmxa
Guest Editors' Foreword
2018
International Journal of Language Translation and Intercultural Communication
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
1
Guest Editors' Foreword Skills can be defined as a group of abilities or proficiencies which are normally acquired through education, experience or training, and in essence, they are critical for employability ...
doi:10.12681/ijltic.17403
fatcat:vkxtw7x7gjgllfsq4emzrixc5a
Guest Editors' Foreword
1997
Educational Considerations
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
GUEST EDITORS' FOREWORD 111is iss ue of Educatiunul Cm" idemlio"s. as wtl l as too next. is de,o ted to tm, financing of public elementary and seco nd ary schools in Anx:rica , Twiee each clccaclc. the ...
Finally. one is struck by the differences. and YCtthe similarilies. of lbe issues in each ,lale , As the editors have writt en for many ycars, the tin ancin g of publ ic eduentiol' continu es to be one ...
doi:10.4148/0146-9282.1356
fatcat:7dblzsxjdvbmff5kjw4etojkl4
Guest Editors' Foreword
2006
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Guest Editors' Foreword This issue of Discrete & Computational Geometry contains the detailed proof by T. Hales and S. P. ...
The second editor became involved in the reviewing process in January 2003. ...
The six papers were submitted to Annals of Mathematics and a team of reviewers was assembled by the first editor. ...
doi:10.1007/s00454-005-1209-8
fatcat:icscg4tto5buxoabofko3etmcy
Guest editors' foreword
1995
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
The editors of this volume have been strongly influenced by Lfiszl6 Fejes T6th. We have learned from his lectures and from his approach to mathematics. ...
We are grateful to the Editors-in-Chief of Discrete & Computational Geometry and to Springer-Verlag for offering to publish this collection in the first place, and for offering to make additional space ...
doi:10.1007/bf02574041
fatcat:lsopapqynjdaxjrgn74lgcijvy
Guest Editors' Foreword
2015
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
This special issue of Discrete & Computational Geometry contains a selection of seven papers whose preliminary versions appeared in the Proceedings of the Annual Symposium on Computational Geometry, Kyoto, Japan, June 8-11, 2014. The seven papers in this issue were invited, submitted, and then reviewed according to the usual, high standards of the journal. These papers cover a wide spectrum of topics in computational geometry. Chan and Lee propose algorithms for a number of geometric problems
doi:10.1007/s00454-015-9680-3
fatcat:3j56wwx2j5fe7emkodkxjc4wcm
more »
... the comparison-based model that achieve optimality in the constant factors of the leading terms. The problems include 2D and 3D maxima, 2D convex hull, segment intersection searching, and point location among axis-parallel boxes in 3D or in a 3D box subdivision. Bonichon, Kanj, Perković, and Xia study the maximum degree of a plane spanner with constant stretch. There is a known lower bound of three, and there has been a series of results that gradually reduce the maximum degree to six. This paper presents a new upper bound of four which almost closes the gap between the upper and lower bounds. Har-Peled and Raichel give a near linear bound on the expected complexity of the multiplicatively weighted Voronoi diagram of n sites in the plane. The locations of the sites are fixed, and the sites can be points, segments, or convex sets. The weights of the sites may be a random sample from a distribution or a random permutation of n
Guest Editors' Foreword
2006
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Guest Editors' Foreword This special issue collects papers from the Twentieth ACM Symposium on Computational Geometry, held on June [9][10][11] 2004 in Brooklyn, NY, USA. ...
We also thank the referees for their thorough efforts and the editors of Discrete & Computational Geometry for their support. ...
doi:10.1007/s00454-006-1261-z
fatcat:6kyv5vy6obg6pljiwut3qpcqsy
Guest editors' foreword
2007
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
It contains six articles that were among the best in the conference. 1 The authors of these papers have been invited by the special issue editors to submit completed versions of their work for this special ...
doi:10.1016/j.tcs.2007.07.022
fatcat:komgxsgx7rfp3kgfklnk4zft5u
Guest Editors' Foreword
2020
Discrete & Computational Geometry
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
photo courtesy of Bojan Mohar) The volume you are holding in your hand is in memory of Branko Grünbaum-one of the giants and founders of Discrete Geometry as we know it today. Throughout his 60-year career, Branko (sometimes almost single-handedly) created and revamped major subfields of this fascinating field. That list includes the theory of convex polytopes, abstract polytopes, Helly's theorem and its relatives, arrangements and spreads, patterns and tilings, and the geometric graph theory,
doi:10.1007/s00454-020-00214-y
fatcat:selvtvyhf5c3jm2ywddd6xf37q
more »
... ust to name a few. The papers presented in this volume attest to the fact that these areas are very much alive and continue to thrive! Describing Branko's mathematical influence (which includes more than 200 descendants) is a daunting task, especially because very few can claim the mathemat-
Guest editors' foreword
2005
Theoretical Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
This was a lively scientific event, held in a relaxed workshop atmosphere that allowed for an informal, but intense, discussion of the status of research in the field of process algebra, broadly construed. The workshop witnessed the continuing vitality of this branch of concurrency theory, and we trust that, apart from being a celebration of over 20 years of research in this field, it contributed to its healthy development by highlighting some open problems, and possible new avenues for
doi:10.1016/j.tcs.2005.01.013
fatcat:e2szysleb5dwtf2saggasd5faq
more »
... . We believe that the papers collected in this volume will offer the process algebra community at large some inspiration for reflection on past achievements, and some suggestions for further research. Our efforts in organizing this workshop, and in editing the present volume, will be amply rewarded if young researchers will be enticed to work in process theory by reading the high quality and varied contributions to this volume, by the solution of some of the open problems that were raised during the event, or by the further development of work along the future directions that were pointed out in Bertinoro. The first contribution to this volume is a piece by Jos Baeten of a historical nature. It provides an excellent, personal introduction to the origin of the ideas that form the basis for the field of process algebra, describes the latest developments in this research area, and offers directions for future work. As such, it serves as a scientific preface to the technical contributions in the volume. The scientific contributions to this volume offer a bird's eye view of different research directions in process algebra. The first of these is a study in classic process algebra by Luttik and van Oostrom that provides a generalization of extant results on parallel decomposition of processes modulo bisimulation equivalence. The paper by Corradini and Vogler gives a contribution to the use of process algebra in the quantitative analysis of concurrent systems. It does so by demonstrating how to adapt their previous work on a testing-based faster-than relation to a setting where user behaviour is known to belong to a specific class of request-response behaviours. In particular, the authors show how to determine an asymptotic performance measure for finite-state processes in their approach. Hybrid systems are systems consisting of discrete components interacting with a continuously evolving environment. In light of the increasing deployment of (control) software 0304-3975/$ -see front matter
« Previous
Showing results 1 — 15 out of 6,454 results