close
1.

図書
図書
1. Quantum information and computation IV : 17-19 April 2006, Kissimmee, Florida, USA
Eric J. Donkor, Andrew R. Pirich, Howard E. Brandt, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2006  1 v. (various pagings) ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 6244
所蔵情報: loading…
2.

図書
図書
2. Photonic devices and algorithms for computing III : 29-30 July, 2001, San Diego, USA
Khan M. Iftekharuddin, Abdul Ahad S. Awwal, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2001  vii, 240 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 4470
所蔵情報: loading…
3.

図書
図書
3. Photonic devices and algorithms for computing IV : 8-9 July, 2002, Seattle, Washington, USA
Khan M. Iftekharuddin, Abdul Ahad S. Awwal, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering ; cooperating organizations, the Boeing Company
出版情報: Bellingham, Washington : SPIE, c2002  x, 262 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 4788
所蔵情報: loading…
4.

図書
図書
4. Photonic devices and algorithms for computing V : 6-7 August, 2003, San Diego, California, USA
Khan M. Iftekharuddin, Abdul Ahad S. Awwal, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2003  vii, 200 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 5201
所蔵情報: loading…
5.

図書
図書
5. Photonic devices and algorithms for computing VI : 2-3 August, 2004, Denver, Colorado, USA
Khan M. Iftekharuddin, Abdul Ahad S. Awwal, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2004  viii, 334 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 5556
所蔵情報: loading…
6.

図書
図書
6. Photonic devices and algorithms for computing VII : 1-2 August, 2005, San Diego, California, USA (pbk.)
Khan M. Iftekharuddin, Abdul A.S. Awwal, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2005  1 v. (various pagings) ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 5907
所蔵情報: loading…
7.

図書
図書
7. Modeling and design of wireless networks : 21-23 August 2001, Denver, USA
Edwin K. P. Chong, chair/editor ; sponsored ... by SPIE--the International Society for Optical Engineering ; cooperating organization, Colorado Photonics Industry Association
出版情報: Bellingham, Wash. : SPIE, c2001  ix, 310 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 4531
所蔵情報: loading…
8.

図書
図書
8. Intelligent computing : theory and applications : 21-22 April, 2003, Orlando, Florida, USA
Kevin L. Priddy, Peter J. Angeline, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2003  viii, 228 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 5103
所蔵情報: loading…
9.

図書
図書
9. Multisensor, multisource information fusion--architectures, algorithms, and applications 2003 : 23-25 April 2003, Orlando, Florida, USA
Belur V. Dasarathy, chair/editor ; sponsored ... by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2003  x, 438 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 5099
所蔵情報: loading…
10.

図書
図書
10. Multisensor, multisource information fusion--architectures, algorithms, and applications 2004 : 14-15 April 2004, Orlando, Florida, USA
Belur V. Dasarathy, chair/editor ; sponsored ... by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash., USA : SPIE, c2004  x, 440 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 5434
所蔵情報: loading…
11.

図書
図書
11. Multisensor, multisource information fusion : architectures, algorithms, and applications 2005 : 30-31 March, 2005, Orlando, Florida, USA
Belur V. Dasarathy, chair/editor ; sponsored and published by SPIE--the International Society for Optical Engineering ; cooperating organizations, Ball Aerospace & Technologies Corporation (USA) ... [et al.].
出版情報: Bellingham, Wash. : SPIE, c2005  xi, 368 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 5813
所蔵情報: loading…
12.

図書
図書
12. Multisensor, multisource information fusion : architectures, algorithms, and applications 2006 : 19-20 April 2006, Kissimmee, Florida, USA
Belur V. Dasarathy, chair/editor ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2006  1 v. (various pagings) ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 6242
所蔵情報: loading…
13.

図書
図書
13. Algorithms in bioinformatics : 4th International Workshop, WABI 2004, Bergen, Norway, September 17-21, 2004 : proceedings
Inge Jonassen, Junhyong Kim (eds.)
出版情報: Berlin : Springer, c2004  ix, 476 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3240 . Lecture notes in bioinformatics
所蔵情報: loading…
14.

図書
図書
14. Experimental and efficient algorithms : 4th International Workshop, WEA 2005, Santorini Island, Greece, May10-13, 2005 : proceedings
Sotiris E. Nikoletseas (ed.)
出版情報: Berlin ; Tokyo : Springer, c2005  xv, 624 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3503
所蔵情報: loading…
15.

図書
図書
15. Sensor fusion--architectures, algorithms, and applications III : 7-9 April 1999, Orlando, Florida
Belur V. Dasarathy, chair/editor ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c1999  ix, 448 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 3719
所蔵情報: loading…
16.

図書
図書
16. Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms
ACM-SIAM Symposium on Discrete Algorithms ; ACM Special Interest Group on Algorithms and Computation Theory ; SIAM Activity Group on Discrete Mathematics
出版情報: New York : Association for Computing Machinery , Philadelphia : Society for Industrial and Applied Mathematics, c2000  xvi, 965 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgments
[varepsilon]-Approximate Linear Progams: New Bounds and Computation / Daniel BienstockSession 1A：
Orthogonal Graph Drawing with Constraints / Markus Eiglsperger ; Ulrich Fo[sz ligature]meier ; Michael Kaufmann
Fast Practical Solution of Sorting by Reversals / Alberto Caprara ; Giuseppe Lancia ; See Kiong Ng
Commuting with Delay Prone Buses / Mayur Datar ; Abhiram Ranade
Coloring Non-Uniform Hypergraphs: A New Algorithmic Approach to the General Lovasz Local Lemma / Artur Czumaj ; Christian ScheidelerSession 1B：
On the Complexity of Bicoloring Clique Hypergraphs of Graphs / J. Kratochvil ; Zs. Tuza
Weakly Chordal Graph Algorithms via Handles / Ryan B. Hayward ; Jeremy Spinrad ; R. Sritharan
Recognizing Dart-Free Perfect Graphs / V. Chvatal ; J. Fonlupt ; L. Sun ; A. Zemirline
An Optimal Algorithm for Hyperplane Depth in the Plane / Stefan Langerman ; William SteigerSession 1C：
On Heilbronn's Problem in Higher Dimension / Hanno Lefmann
Finding Minimal Triangulations of Convex 3-Polytopes Is NP-Hard / Alexander Below ; Jesus A. De Loera ; Jurgen Richter-Gebert
A Point-Placement Strategy for Conforming Delaunay Tetrahedralization / Michael Murphy ; David M. Mount ; Carl W. Gable
Digraph Minors and Algorithms / Robin ThomasSession 2：
Cooperative Facility Location Games / Michel X. Goemans ; Martin SkutellaSession 3A：
K-Medians, Facility Location, and the Chernoff-Wald Bound / Neal E. Young
Improved Approximation Algorithms for MAX SAT / Takao Asano ; David P. Williamson
Strengthening Integrality Gaps for Capacitated Network Design and Covering Problems / Robert D. Carr ; Lisa K. Fleischer ; Vitus J. Leung ; Cynthia A. Phillips
Towards a 4/3 Approximation for the Asymmetric Traveling Salesman Problem / Robert Carr ; Santosh Vempala
Typical Random 3-SAT Formulae and the Satisfiability Threshold / Olivier Dubois ; Yacine Boufkhad ; Jacques MandlerSession 3B：
A Lower Bound for DLL Algorithms for k-SAT / Pavel Pudlak ; Russell Impagliazzo
On Permutations with Limited Independence / Toshiya Itoh ; Yoshinori Takei ; Jun Tarui
Min-Wise Versus Linear Independence / Andrei Z. Broder ; Uriel Feige
Hamiltonicity and Colorings of Arrangement Graphs / Stefan Felsner ; Ferran Hurtado ; Marc Noy ; Ileana Streinu
Testing and Spot-Checking of Data Streams / J. Feigenbaum ; S. Kannan ; M. Strauss ; M. ViswanathanSession 3C：
Engineering the Compression of Massive Tables: An Experimental Approach / Adam L. Buchsbaum ; Donald F. Caldwell ; Kenneth W. Church ; Glenn S. Fowler ; S. Muthukrishnan
On the Temporal HZY Compression Scheme / Z. Cohen ; Y. Matias ; S. C. Sahinalp ; J. Ziv
Height in a Digital Search Tree and the Longest Phrase of the Lempel-Ziv Scheme / Charles Knessl ; Wojciech Szpankowski
Communication Complexity of Document Exchange / Graham Cormode ; Mike Paterson ; Suleyman Cenk Sahinalp ; Uzi Vishkin
Scheduling a Pipelined Operator Graph / Petra Schuurman ; Gerhard J. WoegingerSession 4A：
A PTAS for the Multiple Knapsack Problem / Chandra Chekuri ; Sanjeev Khanna
Approximation Algorithms for Data Placement on Parallel Disks / L. Golubchik ; S. Khanna ; S. Khuller ; R. Thurimella ; A. Zhu
Movement Minimization in Conveyor Flow Shop Processing / W. Espelage ; E. Wanke
Forcing Relations for AND/OR Precedence Constraints / Rolf H. Mohring ; Frederik Stork
The Interlace Polynomial: A New Graph Polynomial / Richard Arratia ; Bela Bollobas ; Gregory B. SorkinSession 4B：
The Complexity of Counting Graph Homomorphisms / Martin Dyer ; Catherine Greenhill
A Fast Algorithm to Generate Unlabeled Necklaces / Frank Ruskey ; Joe Sawada
Construction of Visual Secret Sharing Schemes with Almost Optimal Contrast / Christian Kuhlmann ; Hans Ulrich Simon
Sharing One Secret vs. Sharing Many Secrets: Tight Bounds on the Average Improvement Ratio / Giovanni Di Crescenzo
Algorithmic Strategies in Combinatorial Chemistry / Deborah Goldman ; Sorin Istrail ; Antonio Piccolboni ; Brian WalenzSession 4C：
Computing the Quartet Distance Between Evolutionary Trees / David Bryant ; John Tsang ; Paul Kearney ; Ming Li
A Practical Algorithm for Recovering the Best Supported Edges of an Evolutionary Tree / Vincent Berry ; Tao Jiang ; Todd Wareham ; Haoyong Zhang
Pattern Discovery on Character Sets and Real-Valued Data: Linear Bound on Irredundant Motifs and an Efficient Polynomial Time Algorithm / Laxmi Parida ; Isidore Rigoutsos ; Aris Floratos ; Dan Platt ; Yuan Gao
Improved Bounds on the Sample Complexity of Learning / Yi Li ; Philip M. Long ; Aravind Srinivasan
On Local Search and Placement of Meters in Networks / Samir Khuller ; Randeep Bhatia ; Robert PlessSession 5A：
Improved Approximation Algorithms for the Vertex Cover Problem in Graphs and Hypergraphs / Eran Halperin
An Approximation Algorithm for the Covering Steiner Problem / Goran Konjevod ; R. Ravi
On the Red-Blue Set Cover Problem / Srinivas Doddi ; Madhav Marathe
Approximate Congruence In Nearly Linear Time / Piotr Indyk ; Suresh VenkatasubramanianSession 5B：
Locally Lifting the Curse of Dimensionality for Nearest Neighbor Search / Peter N. Yianilos
Dimensionality Reduction Techniques for Proximity Problems
Expected-Case Complexity of Approximate Nearest Neighbor Searching / Sunil Arya ; Ho-Yam Addy Fu
A Dynamic Programming Approach to De Novo Peptide Sequencing via Tandem Mass Spectrometry / Ting Chen ; Ming-Yang Kao ; Matthew Tepel ; John Rush ; George M. ChurchSession 5C：
Algorithms for Optimizing Production DNA Sequencing / Eva Czabarka ; Madhav V. Marathe ; Allon G. Percus ; David C. Torney
Estimating DNA Sequence Entropy / J. Kevin Lanctot ; En-hui Yang
Selective Mapping: A Discrete Optimization Approach to Selecting a Population Subset for Use in a High-Density Genetic Mapping Project / Daniel G. Brown ; Todd J. Vision ; Steven D. Tanksley
Cutting Planes and the Traveling Salesman Problem / D. Applegate ; R. Bixby ; W. CookSession 6：
Caching in Networks / Friedhelm Meyer auf der Heide ; Berthold Vocking ; Matthias WestermannSession 7A：
Instability of FIFO in Session-Oriented Networks / Matthew Andrews
The Effects of Temporary Sessions on Network Performance / Lisa Zhang
Randomized Greedy Hot-Potato Routing / Costas Busch ; Maurice Herlihy ; Roger Wattenhofer
On Deciding Stability of Scheduling Policies in Queueing Systems / David Gamarnik
Restructuring Ordered Binary Trees / William Evans ; David KirkpatrickSession 7B：
Faster Deterministic Dictionaries / Rasmus Pagh
Competitive Tree-Structured Dictionaries / Michael T. Goodrich
Even Strongly Universal Hashing Is Pretty Fast / Mikkel Thorup
Word Encoding Tree Connectivity Works / Stephen Alstrup ; Jens Peter Secher
Algorithms for Minimum Volume Enclosing Simplex in R[superscript 3] / Yunhong Zhou ; Subhash SuriSession 7C：
Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells / Pankaj K. Agarwal ; Boris Aronov ; Micha Sharir
Evaluating the Cylindricity of a Nominally Cylindrical Point Set / Olivier Devillers ; Franco P. Preparata
Approximation Algorithms for Layered Manufacturing / Pavan K. Desikan
Approximation Algorithms for Projective Clustering / Cecilia M. Procopiuc
Scheduling to Minimize Average Stretch Without Migration / Luca Becchetti ; Stefano LeonardiSession 8A：
Minimizing Maximum Response Time in Scheduling Broadcasts / Yair Bartal
Applying Extra-Resource Analysis to Load Balancing / Mark Brehob ; Eric Torng ; Patchrawat Uthaisombut
Balancing Steiner Trees and Shortest Path Trees Online / Ashish Goel ; Kamesh Munagala
Generating Adversaries for Request-Answer Games / Todd Gormley ; Nicholas Reingold ; Jeffery Westbrook
Maintaining Hierarchical Graph Views / Jeffrey R. WestbrookSession 8B：
Improved Classification via Connectivity Information / Robert Krauthgamer ; Michael Mitzenmacher
Efficient Dynamic Traitor Tracing / Omer Berkman ; Michal Parnas ; Jiri Sgall
Watermarking Maps: Hiding Information in Structured Data / Francis Zane
Strictly Non-Blocking WDM Cross-Connects / April Rasala ; Gordon Wilfong
An Extension of Path Coupling and Its Application to the Glauber Dynamics for Graph Colourings / Leslie Ann Goldberg ; Mark JerrumSession 8C：
A Faster Method for Sampling Independent Sets / Mark Huber
Strong Bias of Group Generators: An Obstacle to the "Product Replacement Algorithm" / Laszlo Babai ; Igor Pak
Random Three-Dimensional Tilings of Aztec Octahedra and Tetrahedra: An Extension of Domino Tilings / Dana Randall ; Gary Yngve
An Algebraic Method to Compute a Shortest Path of Local Flips Between Two Tilings / Eric Remila
Coloring Powers of Planar Graphs / Geir Agnarsson ; Magnus M. HalldorssonSession 9A：
Directed Network Design with Orientation Constraints / Joseph (Seffi) Naor ; F. Bruce Shepherd
A (2 + [varepsilon])-Approximation Scheme for Minimum Domination on Circle Graphs / Mirela Damian-lordache ; Sriram V. Pemmaraju
An Approximation Algorithm for Finding a Long Path in Hamiltonian Graphs / Sundar Vishwanathan
TSP-Based Curve Reconstruction in Polynomial Time / Ernst Althaus ; Kurt MehlhornSession 9B：
A Tree-Edit-Distance Algorithm for Comparing Simple, Closed Shapes / Philip Klein ; Srikanta Tirthapura ; Daniel Sharvit ; Ben Kimia
Computing the Arrangement of Curve Segments: Divide-and-Conquer Algorithms via Sampling / Nancy M. Amato ; Edgar A. Ramos
Optimizing the Sum of Linear Fractional Functions and Applications / Danny Z. Chen ; Ovidiu Daescu ; Yang Dai ; Naoki Katoh ; Xiaodong Wu ; Jinhui Xu
Edge-Disjoint Paths in Expander Graphs / Alan M. FriezeSession 9C：
Escaping a Grid by Edge-Disjoint Paths / Wun-Tat Chan ; Francis Y. L. Chin ; Hing-Fung Ting
Fast Randomized Algorithms for Computing Minimum (3,4,5,6)-Way Cuts / Matthew S. Levine
Adaptive Set Intersections, Unions, and Differences / Erik D. Demaine ; Alejandro Lopez-Ortiz ; J. Ian Munro
The Whole Genome Assembly of Drosophila / Gene MyersSession 10：
A 2 + [varepsilon] Approximation Algorithm for the k-MST Problem / Sanjeev Arora ; George KarakostasSession 11A：
The Prize Collecting Steiner Tree Problem: Theory and Practice / David S. Johnson ; Maria Minkoff ; Steven Phillips
Improved Steiner Tree Approximation in Graphs / Gabriel Robins ; Alexander Zelikovsky
The Rectilinear Steiner Arborescence Problem Is NP-Complete / Weiping Shi ; Chen Su
Improved Bandwidth Approximation for Trees / Anupam Gupta
Faster Algorithms for String Matching with k Mismatches / Amihood Amir ; Moshe Lewenstein ; Ely PoratSession 11B：
On the Shared Substring Alignment Problem / Gad M. Landau ; Michal Ziv-Ukelson
Real Scaled Matching / Ayelet Butman
Inplace Run-Length 2d Compressed Search / Dina Sokol
Pattern Matching in Dynamic Texts / Gerth Stolting Brodal ; Theis Rauhe
Towards a Theory of Cache-Efficient Algorithms / Sandeep Sen ; Siddhartha ChatterjeeSession 11C：
Efficient Bundle Sorting / Yossi Matias ; Eran Segal ; Jeffrey Scott Vitter
Fast Concurrent Access to Parallel Disks / Peter Sanders ; Sebastian Egner ; Jan Korst
On External Memory Graph Traversal / Michael Goldwasser ; Jeffery R. Westbrook
Deterministic Broadcasting in Unknown Radio Networks / Bogdan S. Chlebus ; Leszek Gasieniec ; Alan Gibbons ; Andrzej Pelc ; Wojciech Rytter
New and Improved Algorithms for Minsum Shop Scheduling / Maurice Queyranne ; Maxim SviridenkoSession 12A：
Off-Line Admission Control for General Scheduling Problems / R. N. Uma ; Joel Wein
Approximating the Maximum Quadratic Assignment Problem / Esther M. Arkin ; Refael Hassin
Accurate Approximations for Asian Options / Donald Aingworth ; Rajeev Motwani ; Jeffrey D. Oldham
Finite-Resolution Hidden Surface Removal / Jeff EricksonSession 12B：
On Incremental Rendering of Silhousette Maps of a Polyhedral Scene / Alon Efrat ; Leonidas J. Guibas ; Olaf A. Hall-Holt ; Li Zhang
Computing Contour Trees in All Dimensions / Hamish Carr ; Jack Snoeyink ; Ulrike Axen
Sweeping Simple Polygons with a Chain of Guards / Sariel Har-Peled ; David C. Lin ; Joseph S. B. Mitchell ; T. M. Murali
Finding the Closest Lattice Vector When It's Unusually Close / Session 12C：
A New Bound for the Caratheodory Rank of the Bases of a Matroid / J. C. de Pina ; J. Soares
Minimum Ratio Canceling Is Oracle Polynomial for Linear Programming, But Not Strongly Polynomial, Even for Networks / S. Thomas McCormick ; Akiyoshi Shioura
Nearly Optimal Computations with Structured Matrices / Victor Y. Pan
Author Index
Preface
Acknowledgments
[varepsilon]-Approximate Linear Progams: New Bounds and Computation / Daniel BienstockSession 1A：
17.

図書
図書
17. Algorithms - ESA '99 : 7th Annual European Symposium, Prague, Czech Republic, July 16-18, 1999 : proceedings
Jaroslav Nešetřil (ed.)
出版情報: Berlin ; New York : Springer, c1999  xii, 552 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1643
所蔵情報: loading…
目次情報: 続きを見る
ESA'99 Program
Adaptively-Secure Distributed Public-Key Systems / Yair Frankel ; Moti Yung ; Philip MacKenzie
How Long Does a Bit Live in a Computer? / Bernhard Korte
Approximation Algorithms for the Traveling Purchaser Problem and Its Variants in Network Design / R. Ravi ; F. S. Salman
The Impact of Knowledge on Broadcasting Time in Radio Networks (Extended Abstract) / Krzysztof Diks ; Danny Krizanc ; Evangelos Kranakis ; Andrzej Pelc
Multipacket Routing on 2-D Meshes and Its Application to Fault-Tolerant Routing / Kazuo Iwama ; Eiji Miyano
IP Address Lookup Made Fast and Simple / Pierluigi Crescenzi ; Leandro Dardini ; Roberto Grossi
On-Line Load Balancing in a Hierarchical Server Topology / Amotz Bar-Noy ; Ari Freund ; Joseph Naor
Provably Good and Practical Strategies for Non-uniform Data Management in Networks / Friedhelm Meyer auf der Heide ; Matthias Westermann ; Berthold Vöcking
Approximation Algorithms for Restoration Capacity Planning / Steven J. Phillips ; JefferyR. Westbrook
Efficient Algorithms for Integer Programs with Two Variables per Constraint (Extended Abstract) / Reuven Bar-Yehuda ; Dror Rawitz
Convex Quadratic Programming Relaxations for Network Scheduling Problems / Martin Skutella
Resource-Constrained Project Scheduling: Computing Lower Bounds by Solving Minimum Cut Problems / RolfH. Möhring ; Frederik Stork ; Marc Uetz ; Andreas S. Schulz
Approximation Schemes for Scheduling on Uniformly Related and Identical Parallel Machines / Leah Epstein ; Jiří Sgall
Off-Line Temporary Tasks Assignment / Yossi Azar ; Oded Regev
Load Balancing Using Bisectors - A Tight Average-Case Analysis / Stefan Bischof ; Thomas Schickinger ; Angelika Steger
On the Analysis of Evolutionary Algorithms - A Proof That Crossover Really Can Help / Thomas Jansen ; Ingo Wegener
Motif Statistics / Pierre Nicodème ; Bruno Salvy ; Philippe Flajolet
Approximate Protein Folding in the HP Side Chain Model on Extended Cubic Lattices (Extended Abstract) / Volker Heun
On Constructing Suffix Arrays in External Memory / Andreas Crauser ; Paolo Ferragina
Strategies for Searching with Different Access Costs / Eduardo Sany Laber ; Ruy Luiz Milidiú ; Artur Alves Pessoa
On the Informational Asymmetry between Upper and Lower Bounds for Ultrametric Evolutionary Trees / Ting Chen ; Ming-Yang Kao
Optimal Binary Search with Two Unreliable Tests and Minimum Adaptiveness / Ferdinando Cicalese ; Daniele Mundici
Improving Mergesort for Linked Lists / Salvador Roura
Efficient Algorithms for On-Line Symbol Ranking Compression (Extended Abstract) / Giovanni Manzini
On List Update and Work Function Algorithms / Eric J. Anderson ; Anna R. Karlin ; Kris Hildrum ; April Rasala ; Michael Saks
The 3-Server Problem in the Plane (Extended Abstract) / Wolfgang W. Bein ; Lawrence L. Larmore ; Marek Chrobak
Quartet Cleaning: Improved Algorithms and Simulations / Vincent Berry ; Tao Jiang ; Paul Kearney ; Ming Li ; Todd Wareham
Fast and Robust Smallest Enclosing Balls / Bernd Gärtner
Efficient Searching for Multi-dimensional Data Made Simple (Extended Abstract) / Enrico Nardelli ; Maurizio Talamo ; Paola Vocca
Geometric Searching over the Rationals / Bernard Chazelle
On Computing the Diameter of a Point Set in High Dimensional Euclidean Space / Daniele V. Finocchiaro ; Marco Pellegrini
A Nearly Linear-Time Approximation Scheme for the Euclidean k-median Problem / Stavros G. Kolliopoulos ; Satish Rao
Sum Multi-coloring of Graphs / Magnús M. Halldórsson ; Guy Kortsarz ; Ravit Salman ; Hadas Shachnai
Efficient Approximation Algorithms for the Achromatic Number / Piotr Krysta ; Krzysztof Loryś
Augmentinga (k - 1)-Vertex-Connected Multigraph to an l-Edge-Connected and k-Vertex-Connected Multigraph / Toshimasa Ishii ; Hiroshi Nagamochi ; Toshihide Ibaraki
An Optimisation Algorithm for Maximum Independent Set with Applications in Map Labelling / Bram Verweij ; Karen Aardal
A Decomposition Theorem for Maximum Weight Bipartite Matchings with Applications to Evolutionary Trees / Tak-Wah Lam ; Wing-Kin Sung ; Hing-Fung Ting
Faster Exact Solutions for Some NP-Hard Problems (Extended Abstract) / Limor Drori ; David Peleg
A Polyhedral Algorithm for Packings and Designs / Lucia Moura
Threshold Phenomena in Random Lattices and Efficient Reduction Algorithms / Ali Akhavi
On Finding the Maximum Number of Disjoint Cuts in Seymour Graphs / Alexander A. Ageev
Dilworth's Theorem and Its Application for Path Systems of a Cycle - Implementation and Analysis / András A. Benczúr ; Jörg Förster ; Zoltán Király
On 2-Coverings and 2-Packings of Laminar Families / Joseph Cheriyan ; Tibor Jordán
Random Cayley Graphs with 0(log|G|) Generators Are Expanders / Igor Pak
A Fully Dynamic Algorithm for Recognizing and Representing Proper Interval Graphs / Pavol Hell ; Ron Shamir ; Roded Sharan
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs / Xin He ; Hsueh-I Lu
Author Index
ESA'99 Program
Adaptively-Secure Distributed Public-Key Systems / Yair Frankel ; Moti Yung ; Philip MacKenzie
How Long Does a Bit Live in a Computer? / Bernhard Korte
18.

図書
図書
18. Combinatorial pattern matching : 10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings
Maxime Crochemore, Mike Paterson (eds.)
出版情報: Berlin ; Tokyo : Springer, c1999  viii, 293 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1645
所蔵情報: loading…
19.

図書
図書
19. Algorithms and data structures : 6th International Workshop, WADS '99, Vancouver, Canada, August 11-14, 1999 : proceedings
Frank Dehne ... [et al.], (eds.)
出版情報: Berlin ; Tokyo : Springer, c1999  ix, 368 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1663
所蔵情報: loading…
20.

図書
図書
20. Sensor fusion--architectures, algorithms, and applications : 24-25 April 1997, Orlando, Florida
Belur V. Dasrathy, chair/editor ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c1997  vii, 214 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 3067
所蔵情報: loading…
21.

図書
図書
21. Combinatorial pattern matching : 11th Annual Symposium, CPM 2000, Montreal, Canada, June 21-23, 2000 : proceedings
Raffaele Giancarlo, David Sankoff (eds.)
出版情報: Berlin : Springer, c2000  xi, 422 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1848
所蔵情報: loading…
目次情報: 続きを見る
Invited Lectures
Identifying and Filtering Near-Duplicate Documents / Andrei Z. Broder
Machine Learning for Efficient Natural-Language Processing / Fernando Pereira
Browsing around a Digital Library: Today and Tomorrow / Ian H. Witten
Summer School Lectures
Algorithmic Aspects of Speech Recognition: A Synopsis / Adam L. Buchsbaum ; Raffaele Giancarlo
Some Results on Flexible-Pattern Discovery / Laxmi Parida
Contributed Papers
Explaining and Controlling Ambiguity in Dynamic Programming / Robert Giegerich
A Dynamic Edit Distance Table / Sung-Ryul Kim ; Kunsoo Park
Parametric Multiple Sequence Alignment and Phylogeny Construction / David Fernández-Baca ; Timo Seppäläinen ; Giora Slutzki
Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment / Paul Horton
A Polynomial Time Approximation Scheme for the Closest Substring Problem / Bin Ma
Approximation Algorithms for Hamming Clustering Problems / Leszek Gasieniec ; Jesper Jansson ; Andrzej Lingas
Approximating the Maximum Isomorphic Agreement Subtree Is Hard / Paola Bonizzoni ; Gianluca Della Vedova ; Giancarlo Mauri
A Faster and Unifying Algorithm for Comparing Trees / Ming-Yang Kao ; Tak-Wah Lam ; Wing-Kin Sung ; Hing-Fung Ting
Incomplete Directed Perfect Phylogeny / Itsik Pe'er ; Ron Shamir ; Roded Sharan
The Longest Common Subsequence Problem for Arc-Annotated Sequences / Tao Jiang ; Guo-Hui Lin ; Kaizhong Zhang
Boyer-Moore String Matching over Ziv-Lempel Compressed Text / Gonzalo Navarro ; Jorma Tarhio
A Boyer-Moore Type Algorithm for Compressed Pattern Matching / Yusuke Shibata ; Tetsuya Matsumoto ; Masayuki Takeda ; Ayumi Shinohara ; Setsuo Arikawa
Approximate String Matching over Ziv-Lempel Compressed Text / Juha Kärkkäinen ; Esko Ukkonen
Improving Static Compression Schemes by Alphabet Extension / Shmuel T. Klein
Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments / Nadia El-Mabrouk
A Lower Bound for the Breakpoint Phylogeny Problem / David Bryant
Structural Properties and Tractability Results for Linear Synteny / David Liben-Nowell ; Jon Kleinberg
Shift Error Detection in Standardized Exams / Steven Skiena ; Pavel Sumazin
An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) / Rolf Backofen
The Combinatorial Partitioning Method / Matthew R. Nelson ; Sharon L. Kardia ; Charles F. Sing
Compact Suffix Array / Veli Mäkinen
Linear Bidirectional On-Line Construction of Affix Trees / Moritz G. Maaß
Using Suffix Trees for Gapped Motif Discovery / Emily Rocke
Indexing Text with Approximate q-Grams / Erkki Sutinen ; Jani Tanninen
Simple Optimal String Matching Algorithm / Cyril Allauzen ; Mathieu Raffinot
Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts / Sven Rahmann ; Eric Rivals
Periods and Quasiperiods Characterization / Mireille Régnier ; Laurent Mouchard
Finding Maximal Quasiperiodicities in Strings / Gerth Stølting Brodal ; Christian N.S. Pedersen
On the Complexity of Determining the Period of a String / Arthur Czumaj
Author Index
Invited Lectures
Identifying and Filtering Near-Duplicate Documents / Andrei Z. Broder
Machine Learning for Efficient Natural-Language Processing / Fernando Pereira
22.

図書
図書
22. Algorithmic learning theory : 10th International Conference, ALT '99, Tokyo, Japan, December 6-8, 1999 : proceedings
Osamu Watanabe, Takashi Yokomori (eds.)
出版情報: Berlin : Springer, c1999  xi, 363 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1720 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Invited Lectures
Tailoring Representations to Different Requirements / Katharina Morik
Theoretical Views of Boosting and Applications / Robert E. Schapire
Extended Stochastic Complexity and Minimax Relative Loss Analysis / Kenji Yamanishi
Regular Contributions
Neural Networks
Algebraic Analysis for Singular Statistical Estimation / Sumio Watanabe
Generalization Error of Linear Neural Networks in Unidentifiable Cases / Kenji Fukumizu
The Computational Limits to the Cognitive Power of the Neuroidal Tabula Rasa / Jiri Wiedermann
Learning Dimension
The Consistency Dimension and Distribution-Dependent Learning from Queries / José L. Balcázar ; Jorge Castro ; David Guijarro ; Hans-Ulrich Simon
The VC-Dimension of Subclasses of Pattern Languages / Andrew Mitchell ; Tobias Scheffer ; Arun Sharma ; Frank Stephan
Inductive Inference / Theodoros Evgeniou ; Massimiliano Pontil
On the Strength of Incremental Learning / Steffen Lange ; Gunter Grieser
Learning from Random Text / Peter Rossmanith
Inductive Learning with Corroboration / Phil Watson
Inductive Logic Programming
Flattening and Implication / Kouichi Hirata
Induction of Logic Programs Based on ?-Terms / Yutaka Sasaki
Complexity in the Case Against Accuracy: When Building One Function-Free Horn Clause Is as Hard as Any / Richard Nock
A Method of Similarity-Driven Knowledge Revision for Type Specifications / Nobuhiro Morita ; Makoto Haraguchi ; Yoshiaki Okubo
PAC Learning
PAC Learning with Nasty Noise / Nader H. Bshouty ; Nadav Eiron ; Eyal Kushilevitz
Positive and Unlabeled Examples Help Learning / Francesco De Comité ; François Denis ; Rémi Gilleron ; Fabien Letouzey
Learning Real Polynomials with a Turing Machine / Dennis Cheung
Mathematical Tools for Learning
A Note on Support Vector Machine Degeneracy / Carlos Domingo ; Ryan Rifkin ; Alessandro Verri
Learning Recursive Functions
Learnability of Enumerable Classes of Recursive Functions from "Typical" Examples / Jochen Nessel
On the Uniform Learnability of Approximations to Non-recursive Functions / Thomas Zeugmann
Query Learning
Learning Minimal Covers of Functional Dependencies with Queries / Montserrat Hermo ; Victor Lavin
Boolean Formulas Are Hard to Learn for Most Gate Bases / Víctor Dalmau
Finding Relevant Variables in PAC Model with Membership Queries / Jun Tarui ; Tatsuie Tsukiji
On-Line Learning
General Linear Relations among Different Types of Predictive Complexity / Yuri Kalnishkan
Predicting Nearly as Well as the Best Pruning of a Planar Decision Graph / Eiji Takimoto ; Manfred K. Warmuth
On Learning Unions of Pattern Languages and Tree Patterns / Sally A. Goldman ; Stephen S. Kwek
Author Index
Invited Lectures
Tailoring Representations to Different Requirements / Katharina Morik
Theoretical Views of Boosting and Applications / Robert E. Schapire
23.

図書
図書
23. Algorithms - ESA 2000 : 8th Annual European Symposium, Saarbrücken, Germany, September 5-8, 2000 : proceedings
Mike Paterson (ed.)
出版情報: Berlin : Springer, c2000  ix, 450 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1879
所蔵情報: loading…
24.

図書
図書
24. Algorithms and computation : 9th International Symposium, ISAAC '98, Taejon, Korea, December 14-16, 1998 : proceedings
Kyung-Yong Chwa, Oscar H. Ibarra (eds.)
出版情報: Berlin ; Tokyo : Springer, c1998  xiii, 478 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1533
所蔵情報: loading…
目次情報: 続きを見る
Invited Presentation
The Discrepancy Method / Bernard Chazelle
Implementing Algorithms and Data Structures: An Educational and Research Perspective / Roberto Tamassia
Geometry I
Facility Location on Terrains / Evanthia Papadopoulou ; Boris Aronov ; Marc van Kreveld ; René van Oostrum ; Kasturirangan Varadarajan
Computing Weighted Rectilinear Median and Center Set in the Presence of Obstacles / Joonsoo Choi ; Chan-Su Shin ; Sung Kwon Kim
Complexity I
Maximizing Agreement with a Classification by Bounded or Unbounded Number of Associated Words / Hiroki Arimura ; Shinichi Shimozono
Disjunctions of Horn Theories and Their Cores / Thomas Eiter ; Toshihide Ibaraki ; Kazuhisa Makino
Checking Programs Discreetly: Demonstrating Result-Correctness Efficiently While Concealing It / Giovanni Di Crescenzo ; Kouichi Sakurai ; Moti Yung
Graph Drawing
Two-Layer Planarization in Graph Drawing / Petra Mutzel ; René Weiskircher
Computing Orthogonal Drawings in a Variable Embedding Setting / Walter Didimo ; Giuseppe Liotta
Dynamic Grid Embedding with Few Bends and Changes / Ulrik Brandes ; Dorothea Wagner
On-Line Algorithm and Scheduling
Two New Families of List Update Algorithms / Frank Schulz
An Optimal Algorithm for On-Line Palletizing at Delivery Industry / J. Rethmann ; E. Wanke
On-Line Scheduling of Parallel Jobs with Runtime Restrictions / Stefan Bischof ; Ernst W. Mayr
CAD/CAM and Graphics
Testing the Quality of Manufactured Disks and Cylinders / Prosenjit Bose ; Pat Morin
Casting with Skewed Ejection Direction / Hee-Kap Ahn ; Siu-Wing Cheng ; Otfried Cheong
Repairing Flaws in a Picture Based on a Geometric Representation of a Digital Image / Tetsuo Asano ; Hiro Ito ; Souichi Kimura ; Shigeaki Shimazu
Graph Algorithm I
k-Edge and 3-Vertex Connectivity Augmentation in an Arbitrary Multigraph / Toshimasa Ishii ; Hiroshi Nagamochi
Polyhedral Structure of Submodular and Posi-modular Systems
Maximizing the Number of Connections in Optical Tree Networks / Thomas Erlebach ; Klaus Jansen
Best Paper Presentation
Selecting the k Largest Elements with Parity Tests / Tak Wah Lam ; Hing Fung Ting
Randomized Algorithm
Randomized K-Dimensional Binary Search Trees / Amalia Duch ; Vladimir Estivill-Castro ; Conrado Martínez
Randomized 0(log log n)-Round Leader Election Protocols in Packet Radio Networks / Koji Nakano ; Stephan Olariu
Random Regular Graphs with Edge Faults: Expansion through Cores / Andreas Goerdt
Complexity II
A Quantum Polynomial Time Algorithm in Worst Case for Simon's Problem / Takashi Mihara ; Shao Chin Sung
Generalized Graph Colorability and Compressibility of Boolean Formulae / Richard Nock ; Pascal Jappy ; Jean Sallantin
On the Complexity of Free Monoid Morphisms / Klaus-Jörn Lange ; Pierre McKenzie
Graph Algorithm II
Characterization of Efficiently Solvable Problems on Distance-Hereditary Graphs / Sun-Yuan Hsieh ; Chin-Wen Ho ; Tsan-Sheng Hsu ; Ming-Tat Ko ; Gen-Huey Chen
Fast Algorithms for Independent Domination and Efficient Domination in Trapezoid Graphs / Yaw-Ling Lin
Finding Planar Geometric Automorphisms in Planar Graphs / Seok-Hee Hong ; Peter Eades ; Sang-Ho Lee
Combinatorial Problem
A New Approach for Speeding Up Enumeration Algorithms / Takeaki Uno
Hamiltonian Decomposition of Recursive Circulants / Jung-Heum Park
Convertibility among Grid Filling Curves / Naoki Katoh ; Hisao Tamaki ; Takeshi Tokuyama
Geometry II
Generalized Self-Approaching Curves / Oswin Aichholzer ; Franz Aurenhammer ; Christian Icking ; Rolf Klein ; Elmar Langetepe ; Günter Rote
Computational Biology / Guo-Hui Lin ; Guoliang Xue
Approximation and Exact Algorithms for RNA Secondary Structure Prediction and Recognition of Stochastic Context-Free Languages / Tatsuya Akutsu
On the Multiple Gene Duplication Problem / Michael Fellows ; Michael Hallett ; Ulrike Stege
Geometry III
Visibility Queries in Simple Polygons and Applications / Leonidas J. Guibas ; Marek Teichmann ; Li Zhang
Quadtree Decomposition and Steiner Triangulation and Ray Shooting / Kam-Hing Lee
Optimality and Integer Programming Formulations of Triangulations in General Dimension / Akira Tajima
Approximation Algorithm
Space-Efficient Approximation Algorithms for MAXCUT and COLORING Semidefinite Programs / Philip N. Klein ; Hsueh-I Lu
A Capacitated Vehicle Routing Problem on a Tree / Shin-ya Hamaguchi
Approximation Algorithms for Some Optimum Communication Spanning Tree Problems / Bang Ye Wu ; Kun-Mao Chao ; Chuan Yi Tang
Complexity III
The Edge-Disjoint Paths Problem is NP-Complete for Partial k-Trees / Xiao Zhou ; Takao Nishizeki
Inapproximability Results for Guarding Polygons without Holes / Stephan Eidenbenz
The Inapproximability of Non NP-hard Optimization Problems / Liming Cai ; David Juedes ; Iyad Kanj
Parallel and Distributed Algorithm
An Efficient NC Algorithm for a Sparse k-Edge-Connectivity Certificate / Toru Hasunuma
A Parallel Algorithm for Sampling Matchings from an Almost Uniform Distribution / J. Diaz ; J. Petit ; P. Psycharis ; M. Serna
Optimal Approximate Agreement with Omission Faults / Richard Plunkett ; Alan Fekete
Author Index
Invited Presentation
The Discrepancy Method / Bernard Chazelle
Implementing Algorithms and Data Structures: An Educational and Research Perspective / Roberto Tamassia
25.

図書
図書
25. Algorithm engineering : 3rd International Workshop, WAE'99, London, UK, July 19-21, 1999 : proceedings
Jeffrey S. Vitter, Christos D. Zaroliagis (eds.)
出版情報: Berlin : Springer, c1999  viii, 359 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1668
所蔵情報: loading…
目次情報: 続きを見る
Invited Lectures
Selecting Problems for Algorithm Evaluation / Andrew V. Goldberg
BSP Algorithms - """"Write Once, Run Anywhere"""" / Bill McColl
Ten Years of LEDA: Some Thoughts / Kurt Mehlhorn
Contributed Papers
Computing the K Shortest Paths: A New Algorithm and an Experimental Comparison / Víctor M. Jiménez ; Andrés Marzal
Efficient Implementation of Lazy Suffix Trees / Robert Giegerich ; Stefan Kurtz ; Jens Stoye
Experiments with List Ranking for Explicit Multi-Threaded (XMT) Instruction Parallelism (Extended Abstract) / Shlomit Dascal ; Uzt Vishkin
Finding Minimum Congestion Spanning Trees / Renato Fonseca F. Werneck ; João Carlos Setubal ; Arlindo F. da Conceição
Evaluation of an Algorithm for the Transversal Hypergraph Problem / Dimitris J. Kavvadias ; Elias C. Stavropoulos
Construction Heuristics and Domination Analysis for the Asymmetrie TSP / Fred Glover ; Gregory Gutin ; Anders Yeo ; Alexey Zverovich
Counting in Mobile Networks: Theory and Experimentation / Kostas Hatzis ; George Pentaris ; Paul Spirakis ; Basil Tampakas
Dijkstra's Algorithm On-Line: An Empirical Case Study from Public Railroad Transport / Frank Schulz ; Dorothea Wagner ; Karsten Weihe
Implementation and Experimental Evaluation of Graph Connectivity Algorithms Using LEDA / Panagiota Fatourou ; Panagiotis Zarafidis ; Anna Zoura
On-Line Zone Construction in Arrangements of Lines in the Plane / Yuval Aharoni ; Dan Haiperin ; Iddo Hanniel ; Sariel Har-Peled ; Chaim Linhart
The Design and Implementation of Planar Maps in Cgal / Eyal Flato ; Dan Halperin ; Oren Nechushtan
An Easy to Use Implementation of Linear Perturbations within Cgal / Jochen Comes ; Mark Ziegelmann
Analysing Cache Effects in Distribution Sorting / Naila Rahman ; Rajeev Raman
Fast Regular Expression Search / Gonzalo Navarro ; Mathieu Raffinot
An Experimental Evaluation of Hybrid Data Structures for Searching / Maureen Korda
LEDA-SM: Extending LEDA to Secondary Memory / Andreas Crauser
A Priority Queue Transform / Michael L. Fredman
Implementation Issues and Experimental Study of a Wavelength Routing Algorithm for Irregular All-Optical Networks / Athanasios Bouganis ; Ioannis Caragiannis ; Christos Kaklamanis
Estimating Large Distances in Phylogenetic Reconstruction / Daniel H. Huson ; Kelly Ann Smith ; Tandy J. Warnow
The Performance of Concurrent Red-Black Tree Algorithms / Sabine Hanke
Performance Engineering Case Study: Heap Construction / Jesper Bojesen ; Jyrki Katajainen ; Maz Spork
A Fast and Simple Local Search for Graph Coloring / Massimiliano Caramia ; Paolo Dell'Olmo
BALL: Biochemical Algorithms Library / Nicolas Boghossian ; Oliver Kohlbacher ; Hans-Peter Lenhof
An Experimental Study of Priority Queues in External Memory / Klaus Brengel ; Paolo Ferragina ; Ulrich Meyer
Author Index
Invited Lectures
Selecting Problems for Algorithm Evaluation / Andrew V. Goldberg
BSP Algorithms - """"Write Once, Run Anywhere"""" / Bill McColl
26.

図書
図書
26. Algorithms and computation : 10th International Symposium, ISAAC '99, Chennai, India, December 16-18, 1999 : proceedings
Alok Aggarwal, C. Pandu Rangan (eds.)
出版情報: Berlin : Springer, c1999  xiii, 448 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1741
所蔵情報: loading…
目次情報: 続きを見る
Invited Talk
The Engineering of Some Bipartite Matching Programs / Kurt Mehlhorn
Data Structure I / Session 1(a)：
General Splay: A Basic Theory and Calculus / G.F. Georgakopoulos ; D.J. McClurkin
Static Dictionaries Supporting Rank / Venkatesh Raman ; S. Srinivasa Rao
Parallel & Distributed Computing I / Session 1(b)：
Multiple Spin-Block Decisions / Peter Damaschke
Asynchronous Random Polling Dynamic Load Balancing / Peter Sanders
Approximate Algorithm I / Session 2(a)：
Simple Approximation Algorithms for MAXNAESP and Hypergraph 2-colarability / Daya Ram Gaur ; Ramesh Krishnamurti
Hardness of Approximating Independent Domination in Circle Graphs / Mirela Damian-Iordache ; Sriram V. Pemmaraju
Constant-Factor Approximation Algorithms for Domination Problems on Circle Graphs
Computational Intelligence / Session 2(b)：
Ordered Binary Decision Diagrams as Knowledge-Bases / Takashi Horiyama ; Toshihide Ibaraki
Hard Tasks for Weak Robots: The Role of Common Knowledge in Pattern Formation by Autonomous Mobile Robots / Paola Flocchini ; Giuseppe Prencipe ; Nicola Santoro ; Peter Widmayer
Online Algorithm / Session 3(a)：
On-Line Load Balancing of Temporary Tasks Revisited / Kar-Keung To ; Wai-Ha Wong
Online Routing in Triangulations / Prosenjit Bose ; Pat Morin
Complexity Theory I / Session 3(b)：
The Query Complexity of Program Checking by Constant-Depth Circuits / V. Arvind ; K.V. Subrahmanyam ; N.V. Vinodchandran
Tree-Like Resolution Is Superpolynomially Slower Than DAG-LikeResolution for the Pigeonhole Principle / Kazuo Iwama ; Shuichi Miyazaki
Approximate Algorithm II / Session 4(a)：
Efficient Approximation Algorithms for Multi-label Map Labeling / Binhai Zhu ; C.K. Poon
Approximation Algorithms in Batch Processing / Xiaotie Deng ; Chung Keung Poon ; Yuzhong Zhang
Graph Algorithm I / Session 4(b)：
LexBFS-Ordering in Asteroidal Triple-Free Graphs / Jou-Ming Chang ; Chin-Wen Ho ; Ming-Tat Ko
Parallel Algorithms for Shortest Paths and Related Problems on Trapezoid Graphs / F.R. Hsu ; Yaw-Ling Lin ; Yin-Te Tsai
Approximation Algorithms for Some Clustering and Classification Problems / Eva Tardos
Computational Geometry I / Session 5(a)：
How Many People Can Hide in a Terrain? / Stephan Eidenbenz
Carrying Umbrellas: An Online Relocation Problem on Graphs / Jae-Ha Lee ; Chong-Dae Park ; Kyung-Yong Chwa
Parallel & Distributed Computing II / Session 5(b)：
Survivable Networks with Bounded Delay: The Edge Failure Case / Serafino Cicerone ; Gabriele Di Stefano ; Dagmar Handke
Energy-Efficient Initialization Protocols for Ad-hoc Radio Networks / J.L. Bordim ; J. Cui ; T. Hayashi ; K. Nakano ; S. Olariu
Data Structure II / Session 6(a)：
Constructing the Suffix Tree of a Tree with a Large Alphabet / Tetsuo Shibuya
An O(1) Time Algorithm for Generating Multiset Permutations / Tadao Takaoka
Complexity Theory II / Session 6(b)：
Upper Bounds for MaxSat: Further Improved / Nikhil Bansal
A Linear Time Algorithm for Recognizing Regular Boolean Functions / Kazuhisa Makino
Computational Geometry II / Session 7(a)：
Station Layouts in the Presence of Location Constraints / Christos Kaklamanis ; Lefteris M. Kirousis ; Evangelos Kranakis ; Danny Krizanc ; David Peleg
Reverse Center Location Problem / Jianzhong Zhang ; Xiaoguang Yang ; Mao-cheng Cai
Algorithms in Practice / Session 7(b)：
Performance Comparison of Linear Sieve and Cubic Sieve Algorithms forDiscrete Logarithms over Prime Fields / Abhijit Das ; C.E. Veni Madhavan
External Memory Algorithms for Outerplanar Graphs / Anil Maheshwari ; Norbert Zeh
Approximate Algorithm III / Session 8(a)：
A New Approximation Algorithm for the Capacitated Vehicle Routing Problem on a Tree / Tetsuo Asano ; Naoki Katoh ; Kazuhiro Kawashima
Approximation Algorithms for Channel Assignment with Constraints / Jeannette Janssen ; Lata Narayanan
Graph Algorithm II / Session 8(b)：
Algorithms for Finding Noncrossing Steiner Forests in Plane Graphs / Yoshiyuki Kusakari ; Daisuke Masubuchi ; Takao Nishizeki
A Linear Algorithm for Finding Total Colorings of Partial k-Trees / Shuji Isobe ; Xiao Zhou
Topology-Oriented Approach to Robust Geometric Computation / Kokichi Sugihara
Approximate Algorithm IV / Session 9(a)：
Approximating Multicast Congestion / Santosh Vempala ; Berthold Vöcking
Approximating the Minimum k-way Cut in a Graph via Minimum 3-way Cuts / Liang Zhao ; Hiroshi Nagamochi
Parallel & Distributed Computing III / Session 9(b)：
Online Scheduling of Parallel Communications with Individual Deadlines
A Faster Algorithm for Finding Disjoint Paths in Grids / Wun-Tat Chan ; Francis Y.L. Chin ; Hing-Fung Ting
Computational Geometry III / Session 10(a)：
Output-Sensitive Algorithms for Uniform Partitions of Points / Pankaj K. Agarwal ; Binay K. Bhattacharya ; Sandeep Sen
Convexifying Monotone Polygons / Therese C. Biedl ; Erik D. Demaine ; Sylvain Lazard ; Steven M. Robbins ; Michael A. Soss
Graph Algorithm III / Session 10(b)：
Bisecting Two Subsets in 3-Connected Graphs / Tibor Jordán ; Yoshitaka Nakao
Generalized Maximum Independent Sets for Trees in Subquadratic Time / B.K. Bhattacharya ; M.E. Houle
Author Index
Invited Talk
The Engineering of Some Bipartite Matching Programs / Kurt Mehlhorn
Data Structure I / Session 1(a)：
27.

図書
図書
27. Proceedings of the ninth annual ACM-SIAM Symposium on Discrete Algorithms
ACM-SIAM Symposium on Discrete Algorithms ; ACM Special Interest Group on Algorithms and Computation Theory ; SIAM Activity Group on Discrete Mathematics
出版情報: New York : Association for Computing Machinery , Philadelphia : Society for Industrial and Applied Mathematics, c1998  xii, 704 p. ; 28 cm
所蔵情報: loading…
28.

図書
図書
28. Algorithms - ESA '97 : 5th Annual European Symposium, Graz, Austria, September 15-17, 1997 : proceedings
Rainer Burkard, Gerhard Woeginger (eds.)
出版情報: Berlin ; Tokyo : Springer, c1997  xi, 513 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1284
所蔵情報: loading…
29.

図書
図書
29. Distributed algorithms : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997 : proceedings
Marios Mavronicolas, Philippas Tsigas (eds.)
出版情報: Berlin ; New York : Springer, c1997  x, 332 p.
シリーズ名: Lecture notes in computer science ; 1320
所蔵情報: loading…
30.

図書
図書
30. Algorithms and computation : 8th International Symposium, ISAAC '97, Singapore, December 17-19, 1997 : proceedings
Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)
出版情報: Berlin ; Tokyo : Springer, c1997  xv, 426 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1350
所蔵情報: loading…
31.

図書
図書
31. Combinatorial pattern matching : 9th Annual Symposium, CPM 98, Piscataway, New Jersey, USA, July 20-22, 1998 : proceedings
Martin Farach-Colton (ed.)
出版情報: Berlin : Springer, c1998  viii, 250 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1448
所蔵情報: loading…
32.

図書
図書
32. Approximation algorithms for combinatorial optimization : international workshop APPROX '98, Aalborg, Denmark, July 18-19, 1998 : proceedings
Klaus Jansen, José Rolim (eds.)
出版情報: Berlin : Springer, c1998  viii, 199 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1444
所蔵情報: loading…
目次情報: 続きを見る
Invited Talks
Approximations of independent sets in graphs / Magnús M. Halldórsson
Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems / David B. Shmoys
The steiner tree problem and its generalizations / Vijay V. Vazirani
Contributed Talks
Approximation schemes for covering and scheduling on related machines / Yossi Azar ; Leah Epstein
One for the price of two: A unified approach for approximating covering problems / Reuven Bar-Yehuda
Approximation of geometric dispersion problems / Christoph Baur ; Sándor P. Fekete
Approximating k-outconnected subgraph problems / Joseph Cheriyan ; Tibor Jordan ; Zeev Nutov
Lower bounds for on-line scheduling with precedence constraints on identical machines
Instant recognition of half integrality and 2-approximations / Dorit S. Hochbaum
The t - vertex cover problem: Extending the half integrality framework with budget constraints
A new fully polynomial approximation scheme for the knapsack problem / Hans Kellerer ; Ulrich Pferschy
On the hardness of approximating spanners / Guy Kortsarz
Approximating circular arc colouring and bandwidth allocation in all-optical ring networks / Vijay Kumar
Approximating maximum independent set in k-clique-free graphs / Ingo Schiermeyer
Approximating an interval scheduling problem / Frits C.R. Spieksma
Finding dense subgraphs with semidefinite programming / Anand Srivastav ; Katja Wolf
Best possible approximation algorithm for MAX SAT with cardinality constraint / Maxim I. Sviridenko
Author Index
Invited Talks
Approximations of independent sets in graphs / Magnús M. Halldórsson
Using linear programming in the design and analysis of approximation algorithms: Two illustrative problems / David B. Shmoys
33.

図書
図書
33. Algorithmic learning theory : 9th international conference, ALT '98, Otzenhausen, Germany, October 8-10, 1998 : proceedings
Michael M. Richter... [et al.], (eds.)
出版情報: Berlin ; Tokyo : Springer, c1998  xi, 438 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1501 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Editors' Introduction / M.M. Richter ; C.H. Smith ; R. Wiehagen ; T. Zeugmann
Inductive Logic Programming and Data Mining
Scalability Issues in Inductive Logic Programming (Invited Lecture) / S. Wrobel
Inductive Inference
Learning to Win Process-Control Games Watching Game-Masters / J. Case ; M. Ott ; A. Sharma ; F. Stephan
Closedness Properties in EX-identification of Recursive Functions / K. Apsitis ; R. Freivalds ; R. Simanovskis ; J. Smotrovs
Learning via Queries
Lower Bounds for the Complexity of Learning Half-Spaces with Membership Queries / V.N. Shevchenko ; N.Yu. Zolotykh
Cryptographic Limitations on Parallelizing Membership and Equivalence Queries with Applications to Random Self-Reductions / M. Fischlin
Learning Unary Output Two-Tape Automata from Multiplicity and Equivalence Queries / G. Melideo ; S. Varricchio
Computational Aspects of Parallel Attribute-Efficient Learning / P. Damaschke
PAC Learning from Positive Statistical Queries / F. Denis
Prediction Algorithms
Structured Weight-Based Prediction Algorithms (Invited Lecture) / A. Maruoka ; E. Takimoto
Inductive Logic Programming
Learning from Entailment of Logic Programs with Local Variables / M.K.R. Krishna Rao ; A. Sattar
Logical Aspects of Several Bottom-Up Fittings / A. Yamamoto
Learnability of Translations from Positive Examples / N. Sugimoto
Analysis of Case-Based Representability of Boolean Functions by Monotone Theory / K. Satoh
Learning Formal Languages
Locality, Reversibility, and Beyond: Learning Languages from Positive Data / T. Head ; S. Kobayashi ; T. Yokomori
Synthesizing Learners Tolerating Computable Noisy Data / S. Jain
Characteristic Sets for Unions of Regular Pattern Languages and Compactness / M. Sato ; Y. Mukouchi ; D. Zheng
Finding a One-Variable Pattern from Incomplete Data / H. Sakamoto
A Fast Algorithm for Discovering Optimal String Patterns in Large Text Databases / H. Arimura ; A. Wataki ; R. Fujino ; S. Arikawa
A Comparison of Identification Criteria for Inductive Inference of Recursive Real-Valued Functions / E. Hirowatari
Predictive Learning Models for Concept Drift / S. Kaufmann
Learning with Refutation
Comparing the Power of Probabilistic Learning and Oracle Identification under Monotonicity Constraints / L. Meyer
Learning Algebraic Structures from Text Using Semantical Knowledge / Y. Ventsov
Lime: A System for Learning Relations (Invited Lecture) / E. McCreath
Miscellaneous
On the Sample Complexity for Neural Trees / M. Schmitt
Learning Sub-classes of Monotone DNF on the Uniform Distribution / K.A. Verbeurgt
Using Attribute Grammars for Description of Inductive Inference Search Space / U. Sarkans ; J. BarzdinÜ
Towards the Validation of Inductive Learning Systems / G. Grieser ; K.P. Jantke ; S. Lange
Consistent Polynomial Identification in the Limit / W. Stein
Author Index
Editors' Introduction / M.M. Richter ; C.H. Smith ; R. Wiehagen ; T. Zeugmann
Inductive Logic Programming and Data Mining
Scalability Issues in Inductive Logic Programming (Invited Lecture) / S. Wrobel
34.

図書
図書
34. Algorit[h]ms - ESA '98 : 6th Annual European Symposium, Venice, Italy, August 24-26, 1998 : proceedings
Gianfranco Bilardi ... [et al.] (eds.)
出版情報: Berlin ; London : Springer, c1998  xii, 513 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1461
所蔵情報: loading…
35.

図書
図書
35. Sensor fusion : architectures, algorithms, and applications : 16-17 April 1998, Orlando, Florida (2)
Belur V. Dasrathy, chair/editor
出版情報: Bellingham, Wash. : SPIE, c1998  ix, 240 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 3376
所蔵情報: loading…
36.

図書
図書
36. Proceedings of the tenth annual ACM-SIAM Symposium on Discrete Algorithms
ACM-SIAM Symposium on Discrete Algorithms ; ACM Special Interest Group on Algorithms and Computation Theory ; SIAM Activity Group on Discrete Mathematics
出版情報: New York : Association for Computing Machinery , Philadelphia : Society for Industrial and Applied Mathematics, c1999  xvii, 992 p. ; 28 cm
所蔵情報: loading…
37.

図書
図書
37. Proceedings of the eighth annual ACM-SIAM Symposium on Discrete Algorithms
ACM-SIAM Symposium on Discrete Algorithms ; ACM Special Interest Group on Algorithms and Computation Theory ; SIAM Activity Group on Discrete Mathematics
出版情報: New York : Association for Computing Machinery , Philadelphia : Society for Industrial and Applied Mathematics, c1997  x, 788 p. ; 28 cm
所蔵情報: loading…
38.

図書
図書
38. Distributed algorithms : 10th International Workshop, WDAG '96, Bologna, Italy, October 9-11, 1996 : proceedings
Özalp Babaoğlu, Keith Marzullo (eds.)
出版情報: Berlin : Springer, c1996  viii, 379 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1151
所蔵情報: loading…
39.

図書
図書
39. Proceedings of 1996 IEEE Second International Conference on Algorithms & Architectures for Parallel Processing, ICA[3]PP '96, June 11-13, 1996, Singapore
jointly organized by IEEE Singapore Section, Computer Chapter, IEEE Singapore, and Department of Information Systems and Computer Science, National University of Singapore
出版情報: [New York] : Institute of Electrical and Electronics Engineers , Piscataway, N.J. : IEEE Service Center, c1996  xix, 547 p. ; 31 cm
所蔵情報: loading…
40.

図書
図書
40. Combinatorial pattern matching : 8th Annual Symposium, CPM 97, Aarhus, Denmark, June 30-July 2, 1997 : proceedings
Alberto Apostolico, Jotun Hein (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1997  viii, 274 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1264
所蔵情報: loading…
41.

図書
図書
41. Image processing : mathematical methods and applications
edited by J.M. Blackledge
出版情報: Oxford : Clarendon Press , New York : Oxford University Press, 1997  xviii, 516p. ; 24cm
シリーズ名: The Institute of Mathematics and its Applications conference series ; new ser. 61
所蔵情報: loading…
42.

図書
図書
42. Algorithms and data structures : 5th International Workshop, WADS '97, Halifax, Nova Scotia, Canada, August 6-8, 1997 : proceedings
Frank Dehne ... [et al.], (eds.)
出版情報: Berlin : Springer, c1997  x, 476 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1272
所蔵情報: loading…
43.

図書
図書
43. Parallel algorithms : third DIMACS implementation challenge, October 17-19, 1994
Sandeep N. Bhatt, editor
出版情報: Providence, RI : American Mathematical Society, c1997  xi, 162 p. ; 26 cm
シリーズ名: DIMACS series in discrete mathematics and theoretical computer science ; v. 30
所蔵情報: loading…
目次情報: 続きを見る
Connected components on distributed memory machines / A. Krishnamurthy ; S. S. Lumetta ; D. E. Culler ; K. Yelick
Parallel implementation of algorithms for finding connected components in graphs / T.-S. Hsu ; V. Ramachandran ; N. Dean
Connected components algorithms for mesh-connected parallel computers / S. Goddard ; S. Kumar ; J. F. Prins
Implementing parallel shortest-paths algorithms / M. Papaefthymiou ; J. Rodrigue
Finding friends-of-friends clusters quickly / B. Mumey
A practical comparison of $N$-body algorithms / G. Blelloch ; G. Narlikar
Parallel algorithms for geometric dominance problems / J. Petersson
The $\star$Socrates massively parallel chess program / C. F. Joerg ; B. C. Kuszmaul
Concurrent data structures and load balancing strategies for parallel branch-and-bound/A$^\ast$ algorithms / V.-D. Cung ; S. Dowaji ; B. LeCun ; T. Mautor ; C. Roucairol
Connected components on distributed memory machines / A. Krishnamurthy ; S. S. Lumetta ; D. E. Culler ; K. Yelick
Parallel implementation of algorithms for finding connected components in graphs / T.-S. Hsu ; V. Ramachandran ; N. Dean
Connected components algorithms for mesh-connected parallel computers / S. Goddard ; S. Kumar ; J. F. Prins
44.

図書
図書
44. Algorithms for multispectral and hyperspectral imagery : 5 April 1994, Orlando, Florida
A. Evan Iverson, chair/editor ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash., USA : SPIE, c1994  v, 200 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 2231
所蔵情報: loading…
45.

図書
図書
45. Proceedings of the sixth annual ACM-SIAM Symposium on Discrete Algorithms
ACM-SIAM Symposium on Discrete Algorithms ; ACM Special Interest Group for Automata and Computability Theory ; SIAM Activity Group on Discrete Mathematics
出版情報: New York : Association for Computing Machinery , Philadelphia : Society for Industrial and Applied Mathematics, c1995  654 p. ; 28 cm
所蔵情報: loading…
46.

図書
図書
46. Proceedings of the seventh annual ACM-SIAM Symposium on Discrete Algorithms
ACM-SIAM Symposium on Discrete Algorithms ; ACM Special Interest Group on Algorithms and Computation Theory ; SIAM Activity Group on Discrete Mathematics
出版情報: New York : Association for Computing Machinery , Philadelphia : Society for Industrial and Applied Mathematics, c1996  586 p. ; 28 cm
所蔵情報: loading…
47.

図書
図書
47. Parallel algorithms for irregularly structured problems : Third International Workshop, IRREGULAR '96, Santa Barbara, CA, USA, August 19-21, 1996 : proceedings
A. Ferreira ... [et al.], (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  ix, 358 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1117
所蔵情報: loading…
48.

図書
図書
48. Algorithms -- ESA '96 : Fourth Annual European Symposium, Barcelona, Spain, September 25-27, 1996 : proceedings
Josep Diaz, Maria Serna (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  xii, 566 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1136
所蔵情報: loading…
49.

図書
図書
49. Materials theory, simulations, and parallel algorithms : symposium held November 27-December 1, 1995, Boston, Massachusetts, U.S.A.
editors, Efthimios Kaxiras ... [et al.]
出版情報: Pittsburgh, Pennsylvania : Materials Research Society, 1996  xiv, 611 p. ; 24 cm
シリーズ名: Materials Research Society symposium proceedings ; v. 408
所蔵情報: loading…
50.

図書
図書
50. Combinatorial pattern matching : 7th Annual Symposium, CPM 96, Laguna Beach, California, June 10-12, 1996 : proceedings
Dan Hirschberg, Gene Myers, (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  viii, 391 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1075
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼