DOCSLIB.ORG

Lecture Notes in Computer Science 1272 Edited by G

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text

Load more

Lecture Notes in Computer Science 1272 Edited by G. Goos, J. Hartmanis and J. van Leeuwen Advisory Board: W. Brauer D. Gries J. Stoer Frank Dehne Andrew Rau-Chaplin J6rg-Riidiger Sack Roberto Tamassia (Eds.) Algorithms and Data Structures 5th International Workshop, WADS'97 Halifax, Nova Scotia, Canada August 6-8, 1997 Proceedings ~ Springer Series Editors Gerhard Goos, Karlsruhe University, Germany Juris Hartmanis, Cornell University, NY, USA Jan van Leeuwen, Utrecht University, The Netherlands Volume Editors Frank Dehne J/Srg-Rtidiger Sack Carleton University, School of Computer Science 1125 Colonel By Drive, Ottawa, Canada K1S 5B6 E-mail: (dehne/sack) @scs.carleton.ca Andrew Rau-Chaplin Technical University of Nova Scotia, Department of Computer Science RO. Box 1000, Halifax, Nova Scotia, Canada B3J 2X4 E-mail: [email protected] Roberto Tamassia Brown University, Center for Geometric Computing Providence, RI 02912-1910, USA E-mail: [email protected] Cataloging-in-Publication data applied for Die Deutsche Bibliothek - CIP-Einheitsaufnahme Algorithms and data structures : 5th international workshop ; proceedings / WADS '97, Halifax, Nova Scotia, Canada, August 6 - 8, 1997. Frank Dehne ... (ed.). - Berlin ; Heidelberg ; New York ; Barcelona ; Budapest ; Hong Kong ; London ; Milan ; Paris ; Santa Clara ; Singapore ; Tokyo : Springer, 1997 (Lecture notes in computer science ; Vol. 1272) ISBN 3-540-63307-3 CR Subject Classification (1991): Et-2, E.I, G.2, 1.3.5, H.3.3 ISSN 0302-9743 ISBN 3-540-63307-3 Springer-Verlag Berlin Heidelberg New York This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting, reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the previsions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer-Verlag. Violations are liable for prosecution under the German Copyright Law. © Springer-Verlag Berlin Heidelberg 1997 Printed in Germany Typesetting: Camera-ready by author SPIN 10548848 06/3142 -- 5 4 3 2 1 0 Printed on acid-free paper PREFACE The papers in this volume were presented at the 1997 Workshop on Algorithms and Data Structures (WADS '97). The workshop took place from August 6 to 8, 1997, at TUNS/Dalhousie University in Halifax, Nova Scotia and was sponsored Carleton University and TUNS/Dalhousie University. In response to the program committee's call for papers, 8 1 papers where submitted. From these submissions, the program committee selected 37 papers for presentation at the workshop. In addition to these papers, the workshop included invited presentations Bernard Chazelle, David Dobkin, S. Rao Kosaraju, Ketan Mulmuley, and Christos Papadimitriou. F. Dehne, A. Rau-Chaplin, J.-R. Sack and R. Tamassia August, 1997 WADS Steering Committee F. Dehne (Carleton), I. Munro (Waterloo), J.-R. Sack (Carleton), N. Santoro (Carleton), R. Tamassia (Brown) WADS'97 Program Committee Co-chairs: F. Dehne (Carleton), A. Rau-Chaplin (TUNS/DaI.), J.-R. Sack (Carleton), R. Tamassia (Brown). A. Anderson (Lund), A. Apostolico (Purdue and Padova), G. Ausiello (Rome), C. Bajaj (Purdue), R. Cypher (Johns Hopkins), L. De Floriani (Genova), L. Devroye (McGill), D. Eppstein (Univ. of Calif. at Irvine), M. Farach (Rutgers), A. Ferreira (Ecole Norm. Sup. de Lyon), P. Fraignaud (Ecole Norm. Sup. de Lyon), G. Frederickson (Purdue), M. Goodrich (Johns Hopkins), H. Juergensen (Univ. of Western Ontario), E. Kranakis (Carleton), H.P. Kriegel (Muenchen), D.T. Lee (Northwestern), T. Lengauer (GMD), L. Pagli (Pisa), G. Plaxton (Univ. of Texas at Austin), J. Reif (Duke), N. Santoro (Carleton), P.G. Spirakis (Patras), H. Sudborough (Univ. of Texas at Dallas), P. Vitanyi (CWI), P. Widmayer (ETH), C.K. Wong (Chinese Univ. of Hong Kong). WADS'97 Conference Chair A. Rau-Chaplin (TUNS/Dal.) TABLE OF CONTENTS Session 1: INVITED LECTURE Discrepancy Theory and Computational Geometry Bernard Chazelle Session 2A Dynamic Motion Planning in Low Obstacle Density Environments Robert-Paul Berretty, Mark Overmars and A. Frank van der Stappen 3 Visibility-Based Pursuit-Evasion in a Polygonal Environment Leonidas J. Guibas, Jean-Claude Latombe, Steven M. LaValle, David Lin and Rajeev Motwani 17 Maintaining the Extent of a Moving Point Set Pankaj K. Agarwal, Leonidas J. Guibas, John Hershberger and Eric Veach 31 Session 2B Finding Cores of Limited Length Stephen Alstrup, Peter W. Lauridsen, Peer Sommerlund and Mikkel Thorup 45 On Bipartite Crossings, Largest Biptanar Subgraphs, and the Linear Arrangement Problem Farhad Shahrokhi, Ondrej S~kora, L~.szl6 Sz6kely and Imrich Vrt6 55 Session 3: INVITED LECTURE Approximation Algorithms for a Genetic Diagnostics Problem S. Rao Kosaraju, Alejandro A. Schaeffer and Leslie G. Biesecker 69 Session 4A Cartographic Line Simplification and Polygon CSG Formulae in O(n Log'n) Time John Hershberger and Jack Snoeyink 93 Constrained TSP and Low-Power Computing Moses Charikar, Rajeev Motwani, Prabhakar Raghavan and Craig Silverstein 104 VIII Session 4B On-Line Load Balancing for Related Machines Piotr Berman, Moses Charikar and Marek Karpinski 116 A Linear-Time Algorithm for the 1-Mismatch Problem Nikola Stojanovic, Piotr Berman, Deborah Gumucio, Ross Hardison and Webb Miller 126 Session 5A On Some Geometric Optimization Problems in Layered Manufacturing Jayanth Majhi, Ravi Janardan, Michiel Smid and Prosenjit Gupta 136 New TSP Construction Heuristics and Their Relationships To The 2-Opt Hiroyuki Okano, Shinji Misono and Kazuo Iwano 150 Session 5B Pattern Matching in Hypertext Amihood Amir, Moshe Lewenstein and Noa Lewenstein 160 Multiple Approximate String Matching Ricardo Baeza-Yates and Gonzalo Navarro 174 Session 6: INVITED LECTURE Applied Computational Geometry David P. Dobkin 185 Session 7A Checking the Convexity of Polytopes and the Planarity of Subdivisions O. Devillers, G. Liotta, F. P. Preparata and R. Tamassia 186 Voronoi Diagrams for Polygon-Offset Distance Functions Gill Barequet, Matthew T. Dickerson and Michael T. Goodrich 200 Session 7B Randomized Algorithms for that Ancient Scheduling Problem Steve Selden 210 Optimal Parallel Algorithms for Proximate Points, with Appfications Tatsuya Hayashi, Koji Nakano and Stephan Olariu 224 IX Session 8A An Efficient A/gorithm for Shortest Paths in Vertica/ and Horizonta/ Segments David Eppstein and David W. Hart 234 On Geometric Path Query Problems Danny Z. Chen, Ovidiu Daescu and Kevin S. Klenk 248 Session 8B On-Line Scheduling with Hard Deadlines Sally A. Goldman, Jyoti Parwatikar and Subhash Suri 258 Load Balanced Mapping of Data Structures in Parallel Memory Modules for Fast and Conflict-Free Templates Access Sajal K. Das and M. Cristina Pinotti 272 Session 9: INVITED LECTURE Para//e/ vs. Parametric Comp/exity Ketan Mulmuley 282 Session 10A Position-/ndependent Near Optima/Searching and On- Line Recognition in Star Po/ygons Alejandro Lopez-Ortiz and Sven Schuierer 284 Dynamic Data Structures for Fat Objects and Their App/ications Alon Efrat, Matthew J. Katz, Franck Nielsen and Micha Sharir 297 /ntractabi/ity of Assemb/y Sequencing: Unit Disks in the P/ane Michael Goldwasser and Rajeev Motwani 307 On Hami/tonian Triangu/ations in Simp/e Po/ygons Giri Narasimhan 321 Session 10B Computing Orthogona/ Drawings with the Minimum Number of Bends Paola Bertolazzi, Giuseppe Di Battista and Walter Didimo 331 On a simp/e Depth-First Search Strategy for Exp/oring Unknown Graphs Stephen Kwek 345 Orthogonal Drawing of High Degree Graphs with Small Area and Few Bends Achilleas Papakostas and Ioannis G. Tollis 354 A Centroid Labeling Technique and Its Application to Path Selection in Trees Sarnath Ramnath and Hong Shen 368 Session 11A Offset-Polygon Annulus Placement Problems Gill Barequet, Amy J. Briggs, Matthew T. Dickerson and Michael T. Goodrich 378 Computing Constrained Minimum-Width Annull of Point Sets Mark de Berg, Prosenjit Bose, David Bremner, Suneeta Ramaswami and Gordon Wilfong 392 Geometric Applications of Posets Michael Segal and Klara Kedem 402 Constructing Pairwise Disjoint Paths with Few Links Himanshu Gupta and Rephael Wenger 416 Session 11B Trans-dichotomous Algorithms without Multiplication - Some Upper and Lower Bounds Andrej Brodnik, Peter Bro Miltersen and J. lan Munro 426 An Approximation Algorithm for Stacking up Bins from a Conveyer onto Pallets Jochen Rethman and Egon Wanke 440 Relaxed Balance through Standard Rotations Kim S. Larsen, Eljas Soisalon-Soininen and Peter Widmayer 450 Efficient Breakout Routing in Printed Circuit Boards John Hershberger and Subhash Suri 462 Session 12: INVITED LECTURE Planarity Revisited Zhi-Zhong Chen, Michelangelo Grigni and Christos Papadimitriou 472 Author Index 475 .
Recommended publications
  • Challenges in Web Search Engines

    Challenges in Web Search Engines

    Challenges in Web Search Engines Monika R. Henzinger Rajeev Motwani* Craig Silverstein Google Inc. Department of Computer Science Google Inc. 2400 Bayshore Parkway Stanford University 2400 Bayshore Parkway Mountain View, CA 94043 Stanford, CA 94305 Mountain View, CA 94043 [email protected] [email protected] [email protected] Abstract or a combination thereof. There are web ranking optimiza• tion services which, for a fee, claim to place a given web site This article presents a high-level discussion of highly on a given search engine. some problems that are unique to web search en• Unfortunately, spamming has become so prevalent that ev• gines. The goal is to raise awareness and stimulate ery commercial search engine has had to take measures to research in these areas. identify and remove spam. Without such measures, the qual• ity of the rankings suffers severely. Traditional research in information retrieval has not had to 1 Introduction deal with this problem of "malicious" content in the corpora. Quite certainly, this problem is not present in the benchmark Web search engines are faced with a number of difficult prob• document collections used by researchers in the past; indeed, lems in maintaining or enhancing the quality of their perfor• those collections consist exclusively of high-quality content mance. These problems are either unique to this domain, or such as newspaper or scientific articles. Similarly, the spam novel variants of problems that have been studied in the liter• problem is not present in the context of intranets, the web that ature. Our goal in writing this article is to raise awareness of exists within a corporation.
  • Stanford University's Economic Impact Via Innovation and Entrepreneurship

    Stanford University's Economic Impact Via Innovation and Entrepreneurship

    Full text available at: http://dx.doi.org/10.1561/0300000074 Impact: Stanford University’s Economic Impact via Innovation and Entrepreneurship Charles E. Eesley Associate Professor in Management Science & Engineering W.M. Keck Foundation Faculty Scholar, School of Engineering Stanford University William F. Miller† Herbert Hoover Professor of Public and Private Management Emeritus Professor of Computer Science Emeritus and former Provost Stanford University and Faculty Co-director, SPRIE Boston — Delft Full text available at: http://dx.doi.org/10.1561/0300000074 Contents 1 Executive Summary2 1.1 Regional and Local Impact................. 3 1.2 Stanford’s Approach ..................... 4 1.3 Nonprofits and Social Innovation .............. 8 1.4 Alumni Founders and Leaders ................ 9 2 Creating an Entrepreneurial Ecosystem 12 2.1 History of Stanford and Silicon Valley ........... 12 3 Analyzing Stanford’s Entrepreneurial Footprint 17 3.1 Case Study: Google Inc., the Global Reach of One Stanford Startup ............................ 20 3.2 The Types of Companies Stanford Graduates Create .... 22 3.3 The BASES Study ...................... 30 4 Funding Startup Businesses 33 4.1 Study of Investors ...................... 38 4.2 Alumni Initiatives: Stanford Angels & Entrepreneurs Alumni Group ............................ 44 4.3 Case Example: Clint Korver ................. 44 5 How Stanford’s Academic Experience Creates Entrepreneurs 46 Full text available at: http://dx.doi.org/10.1561/0300000074 6 Changing Patterns in Entrepreneurial Career Paths 52 7 Social Innovation, Non-Profits, and Social Entrepreneurs 57 7.1 Case Example: Eric Krock .................. 58 7.2 Stanford Centers and Programs for Social Entrepreneurs . 59 7.3 Case Example: Miriam Rivera ................ 61 7.4 Creating Non-Profit Organizations ............. 63 8 The Lean Startup 68 9 How Stanford Supports Entrepreneurship—Programs, Cen- ters, Projects 77 9.1 Stanford Technology Ventures Program .........
  • SIGMOD Flyer

    SIGMOD Flyer

    DATES: Research paper SIGMOD 2006 abstracts Nov. 15, 2005 Research papers, 25th ACM SIGMOD International Conference on demonstrations, Management of Data industrial talks, tutorials, panels Nov. 29, 2005 June 26- June 29, 2006 Author Notification Feb. 24, 2006 Chicago, USA The annual ACM SIGMOD conference is a leading international forum for database researchers, developers, and users to explore cutting-edge ideas and results, and to exchange techniques, tools, and experiences. We invite the submission of original research contributions as well as proposals for demonstrations, tutorials, industrial presentations, and panels. We encourage submissions relating to all aspects of data management defined broadly and particularly ORGANIZERS: encourage work that represent deep technical insights or present new abstractions and novel approaches to problems of significance. We especially welcome submissions that help identify and solve data management systems issues by General Chair leveraging knowledge of applications and related areas, such as information retrieval and search, operating systems & Clement Yu, U. of Illinois storage technologies, and web services. Areas of interest include but are not limited to: at Chicago • Benchmarking and performance evaluation Vice Gen. Chair • Data cleaning and integration Peter Scheuermann, Northwestern Univ. • Database monitoring and tuning PC Chair • Data privacy and security Surajit Chaudhuri, • Data warehousing and decision-support systems Microsoft Research • Embedded, sensor, mobile databases and applications Demo. Chair Anastassia Ailamaki, CMU • Managing uncertain and imprecise information Industrial PC Chair • Peer-to-peer data management Alon Halevy, U. of • Personalized information systems Washington, Seattle • Query processing and optimization Panels Chair Christian S. Jensen, • Replication, caching, and publish-subscribe systems Aalborg University • Text search and database querying Tutorials Chair • Semi-structured data David DeWitt, U.
  • The Best Nurturers in Computer Science Research

    The Best Nurturers in Computer Science Research

    The Best Nurturers in Computer Science Research Bharath Kumar M. Y. N. Srikant IISc-CSA-TR-2004-10 http://archive.csa.iisc.ernet.in/TR/2004/10/ Computer Science and Automation Indian Institute of Science, India October 2004 The Best Nurturers in Computer Science Research Bharath Kumar M.∗ Y. N. Srikant† Abstract The paper presents a heuristic for mining nurturers in temporally organized collaboration networks: people who facilitate the growth and success of the young ones. Specifically, this heuristic is applied to the computer science bibliographic data to find the best nurturers in computer science research. The measure of success is parameterized, and the paper demonstrates experiments and results with publication count and citations as success metrics. Rather than just the nurturer’s success, the heuristic captures the influence he has had in the indepen- dent success of the relatively young in the network. These results can hence be a useful resource to graduate students and post-doctoral can- didates. The heuristic is extended to accurately yield ranked nurturers inside a particular time period. Interestingly, there is a recognizable deviation between the rankings of the most successful researchers and the best nurturers, which although is obvious from a social perspective has not been statistically demonstrated. Keywords: Social Network Analysis, Bibliometrics, Temporal Data Mining. 1 Introduction Consider a student Arjun, who has finished his under-graduate degree in Computer Science, and is seeking a PhD degree followed by a successful career in Computer Science research. How does he choose his research advisor? He has the following options with him: 1. Look up the rankings of various universities [1], and apply to any “rea- sonably good” professor in any of the top universities.
  • Acknowledgements

    Acknowledgements

    Acknowledgements So many people have made a significant contribution to this thesis in various ways. Al- though all of them provided me with valuable information, a few played a more direct role in the preparation of this thesis. First of all, I extend my gratitude to my promotor, Mark Overmars, and my co-promotor, Otfried Cheong for their perfect supervision. During the writing of my Ph.D. thesis, Mark Overmars provided many corrections and suggestions for improvement of the manuscript, for which I’m grateful. I am deeply indebted to Otfried Cheong: When I was a M.Sc. student at POSTECH in Korea, he motivated me to do a Ph.D. in Computational Geometry and provided me an offer of being his first Ph.D. student. With unfailing courtesy and monumental patience, he have supervised me in a perfect way, in Hong Kong and the Netherlands. I would also like to thank Siu-Wing Cheng and Mordecai Golin. Siu-Wing Cheng had advised me in various ways, and we had worked together on several problems. Mordecai Golin had showed me interesting geometry problems that I challenged to solve. I should also thank Rene´ van Oostrum. When we were in Hong Kong, I learned from him how to develope films and print photographs. He also helped me a lot when I settled down to the life in the Netherlands, and translated “Summary” into Dutch for this thesis. I must acknowledge my debt to the co-authors of the papers of which this thesis is com- posed: apart from Otfried Cheong, Siu-Wing Cheng and Rene´ van Oostrum, these are Mark de Berg, Prosenjit Bose, Dan Halperin, Jirˇ´ı Matousek,ˇ and Jack Snoeyink.
  • 3SUM with Preprocessing

    3SUM with Preprocessing

    Data Structures Meet Cryptography: 3SUM with Preprocessing Alexander Golovnev Siyao Guo Thibaut Horel Harvard NYU Shanghai MIT [email protected] [email protected] [email protected] Sunoo Park Vinod Vaikuntanathan MIT & Harvard MIT [email protected] [email protected] Abstract This paper shows several connections between data structure problems and cryptography against preprocessing attacks. Our results span data structure upper bounds, cryptographic applications, and data structure lower bounds, as summarized next. First, we apply Fiat{Naor inversion, a technique with cryptographic origins, to obtain a data-structure upper bound. In particular, our technique yields a suite of algorithms with space S and (online) time T for a preprocessing version of the N-input 3SUM problem where S3 · T = Oe(N 6). This disproves a strong conjecture (Goldstein et al., WADS 2017) that there is no data structure that solves this problem for S = N 2−δ and T = N 1−δ for any constant δ > 0. Secondly, we show equivalence between lower bounds for a broad class of (static) data struc- ture problems and one-way functions in the random oracle model that resist a very strong form of preprocessing attack. Concretely, given a random function F :[N] ! [N] (accessed as an oracle) we show how to compile it into a function GF :[N 2] ! [N 2] which resists S-bit prepro- cessing attacks that run in query time T where ST = O(N 2−") (assuming a corresponding data structure lower bound on 3SUM). In contrast, a classical result of Hellman tells us that F itself can be more easily inverted, say with N 2=3-bit preprocessing in N 2=3 time.
  • Jean-Paul Laumond

    Jean-Paul Laumond

    San Francisco CA 1:51:39 m4v Jean-Paul Laumond An interview conducted by Selma Šabanović with Matthew R. Francisco September 27 2011 Q: So if we can start with your name, and where you were born and when? Jean-Paul Laumond: Okay I'm Jean-Paul Laumond. I born in '53 in countryside North from Toulouse in France, in a small village in France. Q: And where did you go to school? Jean-Paul Laumond: I have been to school in Brive which is the main city of the area in that countryside, and after that I entered the university in Toulouse, first by following special training in French which is what we call the “classe préparatoire” for the engineering school. But in fact after two years I moved to university to in the mathematics department and I got a diploma to be a teacher in mathematics. Q: What did you study while you were in university and how did you decide on that particular direction? Jean-Paul Laumond: <clears throat> At the very beginning, I was not very convinced by the choice I made to enter into engineering, because engineering is to go towards the industry world while I was more interested by the academic position. And at that time I didn't know that engineering could be a possibility to enter the university or to make then. Then for me it was just pure abstraction or like literature, and then this is why and of course I was very enthusiastic with mathematics, and this is why I chosen to enter in the university in the department of mathematics.
  • Creative and Coordinated Computation

    Creative and Coordinated Computation

    Creative and Coordinated Computation Inaugural address delivered by Marc van Kreveld Professor in Computational Geometry and its Application Department of Information and Computing Sciences Faculty of Science Utrecht University on Friday, January 17, 2014 Utrecht, The Netherlands c Marc van Kreveld, 2014 Rector magnificus, colleagues, family, friends, ... I am honored to stand before you today, and have the opportunity to tell you all about my work, my research, and some other things that I will get to later. It is Friday afternoon, after 4 o'clock, and I realize that most people would call this the beginning of the weekend. However, I am going to be talking about scientific work for a while, so bear with me. I promise that I will not show any formulas, but I will show many illustrations. I truly hope that everyone in the audience will hear something worthwhile in this lecture. My research is related to geometry, a branch of mathematics that deals with objects, like points, lines, triangles and circles, and addresses rela- tions between these objects, like distances, intersections, and containment, or properties like lengths, areas, and angles. My research is also about al- gorithms, the use of automated methods to execute tasks, and the formal study of these methods. The third aspect of my research is applications, because points, triangles and circles can have a concrete meaning in appli- cations only, and the application dictates which tasks we want to perform on the geometry. The title of this speech, \Creative and Coordinated Computation", may seem contradictory: a creative process is often not coordinated, and more- over, coordination may obstruct creativity.
  • Geometric Problems in Cartographic Networks

    Geometric Problems in Cartographic Networks

    Geometric Problems in Cartographic Networks Geometrische Problemen in Kartografische Netwerken (met een samenvatting in het Nederlands) PROEFSCHRIFT ter verkrijging van de graad van doctor aan de Universiteit Utrecht op gezag van de Rector Magnificus, Prof. Dr. W.H. Gispen, ingevolge het besluit van het College voor Promoties in het openbaar te verdedigen op maandag 29 maart 2004 des middags te 16:15 uur door Sergio Cabello Justo geboren op 1 december 1977, te Lleida Promotor: Prof. Dr. Mark H. Overmars Copromotor: Dr. Marc J. van Kreveld Faculteit Wiskunde en Informatica Universiteit Utrecht Advanced School for Computing and Imaging This work was carried out in the ASCI graduate school. ASCI dissertation series number 99. This work has been supported mainly by the Cornelis Lely Stichting, and par- tially by a Marie Curie Fellowship of the European Community programme \Combinatorics, Geometry, and Computation" under contract number HPMT- CT-2001-00282, and a NWO travel grant. Dankwoord / Agradecimientos It is my wish to start giving my deepest thanks to my supervisor Marc van Kreveld and my promotor Mark Overmars. I am also very grateful to Mark de Berg, who also participated in my supervision in the beginning. Without trying it, you made me think that I was in the best place to do my thesis. I would also like to thank Pankaj Agarwal, Mark de Berg, Jan van Leeuwen, Gun¨ ter Rote, and Dorothea Wagner for taking part in the reading committee and giving comments. I would also like to thank the co-authors who directly par- ticipate in this thesis: Mark de Berg, Erik Demaine, Steven van Dijk, Yuanxin (Leo) Liu, Andrea Mantler, Gun¨ ter Rote, Jack Snoeyink, Tycho Strijk, and, of course, Marc van Kreveld.
  • Practical Considerations in Benchmarking Digital Testing Systems

    Practical Considerations in Benchmarking Digital Testing Systems

    Foreword The papers in these proceedings were presented at the 39th Annual Symposium on Foundations of Computer Science (FOCS ‘98), sponsored by the IEEE Computer Society Technical Committee on Mathematical Foundations of Computing. The conference was held in Palo Alto, California, November g-11,1998. The program committee consisted of Miklos Ajtai (IBM Almaden), Mihir Bellare (UC San Diego), Allan Borodin (Toronto), Edith Cohen (AT&T Labs), Sally Goldman (Washington), David Karger (MIT), Jon Kleinberg (Cornell), Rajeev Motwani (chair, Stanford)), Seffi Naor (Technion), Christos Papadimitriou (Berkeley), Toni Pitassi (Arizona), Dan Spielman (MIT), Eli Upfal (Brown), Emo Welzl (ETH Zurich), David Williamson (IBM TJ Watson), and Frances Yao (Xerox PARC). The program committee met on June 26-28, 1998, and selected 76 papers from the 204 detailed abstracts submitted. The submissions were not refereed, and many of them represent reports of continuing research. It is expected that most of these papers will appear in a more complete and polished form in scientific journals in the future. The program committee selected two papers to jointly receive the Machtey Award for the best student-authored paper. These two papers were: “A Factor 2 Approximation Algorithm for the Generalized Steiner Network Problem” by Kamal Jain, and “The Shortest Vector in a Lattice is Hard to Approximate to within Some Constant” by Daniele Micciancio. There were many excellent candidates for this award, each one deserving. At this conference we organized, for the first time, a set of three tutorials: “Geometric Computation and the Art of Sampling” by Jiri Matousek; “Theoretical Issues in Probabilistic Artificial Intelligence” by Michael Kearns; and, “Information Retrieval on the Web” by Andrei Broder and Monika Henzinger.
  • The Pagerank Citation Ranking: Bringing Order to the Web

    The Pagerank Citation Ranking: Bringing Order to the Web

    The PageRank Citation Ranking: Bringing Order to the Web Marlon Dias [email protected] Information Retrieval DCC/UFMG - 2017 Introduction Paper: The PageRank Citation Ranking: Bringing Order to the Web, 1999 Authors: Lawrence Page, Sergey Brin, Rajeev Motwani, Terry Winograd Page and Brin were MS students at Stanford They founded Google in September, 98. Most of this presentation is based on the original paper (link) The Initiative's focus is to dramatically “ advance the means to collect, store, and organize information in digital forms, and make it available for searching, retrieval, and processing via communication networks -- all in user-friendly ways. Stanford WebBase project Pagerank Motivation ▪ Web is vastly large and heterogeneous ▫ Original paper's estimation were over 150 M pages and 1.7 billion of links ▪ Pages are extremely diverse ▫ Ranging from "What does the fox say? " to journals about IR ▪ Web Page present some "structure" ▫ Pagerank takes advantage of links structure Pagerank Motivation ▪ Inspiration: Academic citation ▪ Papers ▫ are well defined units of work ▫ are roughly similar in quality ▫ are used to extend the body of knowledge ▫ can have their "quality" measured in number of citations Pagerank Motivation ▪ Web pages, on the other hand ▫ proliferate free of quality control or publishing costs ▫ huge numbers of pages can be created easily ▸ artificially inflating citation counts ▫ They vary on much wider scale than academic papers in quality, usage, citations and length Pagerank Motivation A research article A random archived about the effects of message posting cellphone use on asking an obscure driver attention is very question about an IBM different from an computer is very advertisement for a different from the IBM particular cellular home page provider The average web page quality experienced “ by a user is higher than the quality of the average web page.
  • Computational Geometry

    Computational Geometry

    Computational Geometry Third Edition Mark de Berg · Otfried Cheong Marc van Kreveld · Mark Overmars Computational Geometry Algorithms and Applications Third Edition 123 Prof. Dr. Mark de Berg Dr. Marc van Kreveld Department of Mathematics Department of Information and Computer Science and Computing Sciences TU Eindhoven Utrecht University P.O. Box 513 P.O. Box 80.089 5600 MB Eindhoven 3508 TB Utrecht The Netherlands The Netherlands [email protected] [email protected] Dr. Otfried Cheong, ne´ Schwarzkopf Prof. Dr. Mark Overmars Department of Computer Science Department of Information KAIST and Computing Sciences Gwahangno 335, Yuseong-gu Utrecht University Daejeon 305-701 P.O. Box 80.089 Korea 3508 TB Utrecht [email protected] The Netherlands [email protected] ISBN 978-3-540-77973-5 e-ISBN 978-3-540-77974-2 DOI 10.1007/978-3-540-77974-2 ACM Computing Classification (1998): F.2.2, I.3.5 Library of Congress Control Number: 2008921564 © 2008, 2000, 1997 Springer-Verlag Berlin Heidelberg This work is subject to copyright. All rights are reserved, whether the whole or part of the material is concerned, specifically the rights of translation, reprinting, reuse of illustrations, recitation, broadcasting, reproduction on microfilm or in any other way, and storage in data banks. Duplication of this publication or parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965, in its current version, and permission for use must always be obtained from Springer. Violations are liable for prosecution under the German Copyright Law. The use of general descriptive names, registered names, trademarks, etc.