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…
51.

図書
図書
51. Algorithms -- ESA '95 : Third Annual European Symposium, Corfu, Greece, September 25-27, 1995 : proceedings
Paul Spirakis (ed.)
出版情報: Berlin ; Tokyo : Springer, c1995  xii, 598 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 979
所蔵情報: loading…
52.

図書
図書
52. Algorithms and computations : 6th International Symposium, ISAAC '95, Cairns, Australia, December 4-6, 1995 : proceedings
John Staples ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c1995  xv, 440 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1004
所蔵情報: loading…
53.

図書
図書
53. Algorithms, concurrency and knowledge : 1995 Asian Computing Science Conference, ACSC '95, Pathumthani, Thailand, December 11-13, 1995 : proceedings
Kanchana Kanchanasut, Jean-Jacques Lévy (eds.)
出版情報: Berlin ; Tokyo : Springer, c1995  x, 410 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1023
所蔵情報: loading…
54.

図書
図書
54. Combinatorial pattern matching : 6th Annual Symposium, CPM 95, Espoo, Finland, July 5-7, 1995 : proceedings (: gw)
Zvi Galil, Esko Ukkonen, (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1995  viii, 407 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 937
所蔵情報: loading…
55.

図書
図書
55. Algorithms and data structures : 4th International Workshop, WADS '95, Kingston, Canada, August 16-18, 1995 : proceedings (: gw)
Selim G. Akl ... [et al.], (eds.)
出版情報: Berlin : Springer, c1995  ix, 517 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 955
所蔵情報: loading…
56.

図書
図書
56. Distributed algorithms : 9th International Workshop, WDAG '95, Le Mont-Saint-Michel, France, September 13-15, 1995 : proceedings (: gw)
Jean-Michel Hélary, Michel Raynal (eds.)
出版情報: Berlin ; New York : Springer-Verlag, c1995  xi, 333 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 972
所蔵情報: loading…
57.

図書
図書
57. Parallel algorithms for irregularly structured problems : Second International Workshop, IRREGULAR '95, Lyon, France, September 4-6, 1995 : proceedings (: gw)
Afonso Ferreira, José Rolim (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1995  x, 409 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 980
所蔵情報: loading…
58.

図書
図書
58. Algorithmic learning theory : 7th International Workshop, ALT '96, Sydney, Australia, October 23-25, 1996 : proceedings
Setsuo Arikawa, Arun K. Sharma, (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer, c1996  xvii, 336 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1160 . Lecture notes in artificial intelligence
所蔵情報: loading…
59.

図書
図書
59. Algorithms and computation : 7th International Symposium, ISAAC '96, Osaka, Japan, December 16-18, 1996 : proceedings
Tetsuo Asano ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  x, 448 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1178
所蔵情報: loading…
60.

図書
図書
60. Algorithmic learning theory : 4th International Workshop on Analogical and Inductive Inference, AII '94 [and] 5th International Workshop on Algorithmic Learning Theory, ALT '94, Reinhardsbrunn Castle, Germany, October 10-15, 1994 : proceedings (: gw ; : us)
Setsuo Arikawa, Klaus P. Jantke, (eds.)
出版情報: Berlin ; New York : Springer-Verlag, c1994  xiv, 573 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 872 . Lecture notes in artificial intelligence
所蔵情報: loading…
61.

雑誌
雑誌
61. Proceedings of the ... 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  v. ; 28 cm
所蔵情報: loading…
62.

図書
図書
62. Algorithms and data structures : 2nd workshop WADS '91, Ottawa, Canada, August 14-16, 1991 : proceedings (: gw ; : us)
F. Dehne, J.-R. Sack, N. Santoro, (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1991  x, 495 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 519
所蔵情報: loading…
63.

図書
図書
63. Distributed algorithms : 5th international workshop, WDAG '91, Delphi, Greece, October 7-9, 1991 : proceedings (: gw ; : us)
S. Toueg, P.G. Spirakis, L. Kirousis, (eds)
出版情報: Berlin ; New York : Springer-Verlag, c1992  x, 318 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 579
所蔵情報: loading…
64.

図書
図書
64. Data structures and efficient algorithms : final report on the DFG special joint initiative (: gw ; : us)
B. Monien, Th. Ottmann (eds.)
出版情報: Berlin ; New York : Springer-Verlag, c1992  viii, 389 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 594
所蔵情報: loading…
65.

図書
図書
65. Algorithms and computation : Third International Symposium, ISAAC '92, Nagoya, Japan, December 16-18, 1992 : proceedings (: gw ; : us)
T. Ibaraki ... [et al.] (eds.)
出版情報: Berlin ; New York : Springer-Verlag, c1992  xi, 510 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 650
所蔵情報: loading…
66.

図書
図書
66. Combinatorial pattern matching : Third Annual Symposium, Tucson, Arizona, USA, April 29-May 1, 1992 : proceedings (: gw ; : us)
A. Apostolico ... [et al.] (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1992  x, 287 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 644
所蔵情報: loading…
67.

図書
図書
67. ISA '91 algorithms : 2nd International Symposium on Algorithms, Taipei, Republic of China, December 16-18, 1991 : proceedings (: gw ; : us)
W.L. Hsu, R.C.T. Lee, (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1991  x, 395 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 557
所蔵情報: loading…
68.

図書
図書
68. Algorithms, software, architecture
edited by Jan van Leeuwen
出版情報: Amsterdam ; Tokyo : North-Holland, 1992  xxix, 717 p. ; 23 cm
シリーズ名: IFIP transactions ; A . Computer science and technology ; 12 ; Information processing 92 : proceedings of the IFIP 12th World Computer Congress, Madrid, Spain, 7-11 September 1992 ; vol. 1
所蔵情報: loading…
69.

図書
図書
69. Distributed algorithms : 6th International Workshop, WDAG '92, Haifa, Israel, November 2-4, 1992 : proceedings (: gw ; : us)
A. Segall, S. Zaks (eds.)
出版情報: Berlin ; New York : Springer-Verlag, c1992  x, 378 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 647
所蔵情報: loading…
70.

図書
図書
70. Algorithms : International Symposium SIGAL '90, Tokyo, Japan, August 16-18, 1990 : proceedings (: gw ; : us)
T. Asano ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1990  viii, 478 p. ; 25 cm
シリーズ名: Lecture notes in computer science ; 450
所蔵情報: loading…
71.

図書
図書
71. Algorithms and computation : 4th International Symposium, ISAAC '93, Hong Kong, December 15-17, 1993 : proceedings (: gw ; : us)
K.W. Ng ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1993  xiii, 542 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 762
所蔵情報: loading…
72.

図書
図書
72. Proceedings of the fifth 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, c1994  735 p. ; 28 cm
所蔵情報: loading…
73.

図書
図書
73. Distributed algorithms : 7th International Workshop, WDAG '93, Lausanne, Switzerland, September 27-29, 1993 : proceedings (: us ; : gw)
André Schiper (ed.)
出版情報: Berlin ; New York : Springer-Verlag, c1993  viii, 323 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 725
所蔵情報: loading…
74.

図書
図書
74. Algorithms -- ESA '93 : First Annual European Symposium, Bad Honnef, Germany, September 30-October 2, 1993 : proceedings (: us ; : gw)
Thomas Lengauer (ed.)
出版情報: Berlin ; New York : Springer-Verlag, c1993  ix, 418 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 726
所蔵情報: loading…
75.

図書
図書
75. Algorithms & architectures : proceedings of the Second NEC Research Symposium
edited by T. Ishiguro
出版情報: Philadelphia : Society for Industrial and Applied Mathematics, c1993  x, 282 p. ; 26 cm
所蔵情報: loading…
76.

図書
図書
76. Combinatorial pattern matching : 5th Annual Symposium, CPM 94, Asilomar, CA, USA, June 5-8, 1994 : proceedings (: gw ; : us)
Maxime Crochemore, Dan Gusfield (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1994  325 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 807
所蔵情報: loading…
77.

図書
図書
77. Algorithms and computation : 5th International Symposium, ISAAC '94, Beijing, P.R. China, August 25-27, 1994 : proceedings (: gw ; : us)
Ding-Zhu Du, Xiang-Sun Zhang (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1994  xiii, 688 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 834
所蔵情報: loading…
78.

図書
図書
78. Distributed algorithms : 8th International Workshop, WDAG '94, Terschelling, The Netherlands, September 29-October 1, 1994 : proceedings (: Berlin ; : New York)
Gerard Tel, Paul Vitányi (eds.)
出版情報: Berlin ; New York : Springer-Verlag, c1994  x, 369 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 857
所蔵情報: loading…
79.

図書
図書
79. Algorithms -- ESA '94 : Second Annual European Symposium, Utrecht, The Netherlands, September 26-28, 1994 : proceedings (: gw ; : us)
Jan van Leeuwen (ed.)
出版情報: Berlin ; New York : Springer-Verlag, c1994  x, 510 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 855
所蔵情報: loading…
80.

図書
図書
80. Evolutionary computing : AISB Workshop, Leeds, U.K., April 11-13, 1994 : selected papers (: gw ; : us)
Terence C. Fogarty, (ed.)
出版情報: Berlin ; New York : Springer-Verlag, c1994  xii, 332 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 865
所蔵情報: loading…
81.

図書
図書
81. Combinatorial pattern matching : 4th annual symposium, CPM 93, Padova, Italy, June 2-4, 1993, proceedings (: gw ; : us)
A. Apostolico ... [et al.] (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1993  viii, 265 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 684
所蔵情報: loading…
82.

図書
図書
82. Parallel architectures and their efficient use : First Heinz Nixdorf Symposium, Paderborn, Germany, November 11-13, 1992 : proceedings (: gw ; : us)
F. Meyer auf der Heide, B. Monien, A.L. Rosenberg, (eds.)
出版情報: Berlin ; New York : Springer-Verlag, c1993  xii, 227 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 678
所蔵情報: loading…
83.

図書
図書
83. Algorithms and data structures : third workshop, WADS '93, Montréal, Canada, August 11-13, 1993 : proceedings (: us ; : gw)
Frank Dehne ... [et al.], (eds.)
出版情報: Berlin ; New York : Springer-Verlag, c1993  xii, 633 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 709
所蔵情報: loading…
84.

図書
図書
84. Local search for planning and scheduling : ECAI 2000 Workshop, Berlin, Germany, August 21, 2000 : revised papers
Alexander Nareyek (ed.)
出版情報: Berlin ; New York : Springer, c2001  vi, 169 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2148 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
Invited Paper
Meta-heuristics: The State of the Art / Stefan Voß
Combinatorial Optimization
Solving the Sports League Scheduling Problem with Tabu Search / Jean-Philippe Hamiez ; Jin-Kao Hao
Lagrange Multipliers for Local Search on Planning Graphs / Alfonso Gerevini ; Ivan Serina
Planning with Resources
Beyond the Plan-Length Criterion / Alexander Nareyek
An Empirical Evaluation of the Effectiveness of Local Search for Replanning / Steve Chien ; Russell Knight ; Gregg Rabideau
Board-Laying Techniques Improve Local Search in Mixed Planning and Scheduling
Empirical Evaluation of Local Search Methods for Adapting Planning Policies in a Stochastic Environment / Barbara Engelhardt
Related Approaches
The GRT Planner: New Results / Ioannis Refanidis ; Ioannis Vlahavas
Incremental Local Search for Planning Problems / Eva Onaindia ; Laura Sebastia ; Eliseo Marzal
Map Drawing Based on a Resource-Constrained Search for a Navigation System / Hironori Hiraishi ; Fumio Mizoguchi
Author Index
Invited Paper
Meta-heuristics: The State of the Art / Stefan Voß
Combinatorial Optimization
85.

図書
図書
85. Algorithms and Computation : 12th International Symposium, ISAAC 2001, Christchurch, New Zealand, December 19-21, 2001 : proceedings
Peter Eades, Tadao Takaoka (eds.)
出版情報: Berlin : Springer, c2001  xiv, 780 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2223
所蔵情報: loading…
86.

図書
図書
86. Large-Scale Scientific Computing : Third International Conference, LSSC 2001, Sozopol, Bulgaria, June 6-10, 2001 : revised papers
Svetozar Margenov, Jerzy Waśniewski, Plamen Yalamov (eds.)
出版情報: Berlin : Springer, c2001  xi, 498 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2179
所蔵情報: loading…
87.

図書
図書
87. Sensor fusion : architectures, algorithms, and applications IV : 25-28 April 2000, Orlando, USA
Belur V. Dasarathy, chair/editor ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c2000  ix, 478 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 4051
所蔵情報: loading…
88.

図書
図書
88. Combinatorial pattern matching : 14th Annual Symposium, CPM 2003, Morelia, Michoacán, Mexico, June 25-27, 2003 : proceedings
Ricardo Baeza-Yates, Edgar Chávez, Maxime Crochemore (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xi, 401 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2676
所蔵情報: loading…
89.

図書
図書
89. Algorithms and data structures : 8th International Workshop, WADS 2003, Ottawa, Ontario, Canada, July 30-August 1, 2003 : proceedings
Frank Dehne, Jörg-Rüdiger Sack, Michiel Smid (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xii, 522 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2748
所蔵情報: loading…
90.

図書
図書
90. Approximation, randomization, and combinatorial optimization : algorithms and techniques : 6th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX 2003, and 7th International Workshop on Randomization and Approximation Techniques in Computer Science, RANDOM 2003, Princeton, NJ, USA, August 24-26, 2003 : proceedings
Sanjeev Arora ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  ix, 408 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2764
所蔵情報: loading…
91.

図書
図書
91. Proceedings of the Fourteenth 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, c2003  xvi, 874 p. ; 28 cm
所蔵情報: loading…
目次情報: 続きを見る
Preface
Acknowledgments
In Memoriam
Optimal Parallel Selection / Yijie HanSession 1A：
Selection with Monotone Comparison Costs / Sampath Kannan ; Sanjeev Khanna
Property Testing of Data Dimensionality / Robert Krauthgamer ; Ori Sasson
Comparing Top K Lists / Ronald Fagin ; Ravi Kumar ; D. Sivakumar
Algorithms for Power Savings / Sandy Irani ; Sandeep Shukla ; Rajesh GuptaSession 1B：
Dynamic TCP Acknowledgement: Penalizing Long Delays / Susanne Albers ; Helge Bals
Approximately Optimal Control of Fluid Networks / Lisa Fleischer ; Jay Sethuraman
Minimum Cost Flows over Time without Intermediate Storage / Martin Skutella
Sublogarithmic Approximation for Telephone Multicast: Path out of Jungle / Michael Elkin ; Guy KortsarzSession 1C：
On the Performance of User Equilibria in Traffic Networks / Andreas S. Schulz ; Nicolas Stier Moses
Faster Approximation Algorithms for the Minimum Latency Problem / Aaron Archer ; David P. Williamson
Data Migration to Minimize the Average Completion Time / Yoo-Ah Kim
Invited Plenary Abstract / Session 2：
Browsing around a Digital Library / Ian H. Witten
Binary Space Partitions for 3D Subdivisions / John Hershberger ; Subhash SuriSession 3A：
Allocating Vertex [pi]-Guards in Simple Polygons via Pseudo-triangulations / Bettina Speckmann ; Csaba D. Toth
Straight-Skeleton Based Contour Interpolation / Gill Barequet ; Michael T. Goodrich ; Aya Levi-Steiner ; Dvir Steiner
Mobius-Invariant Natural Neighbor Interpolation / Marshall Bern ; David Eppstein
Improved Bounds on the Average Length of Longest Common Subsequences / George S. LuekerSession 3B：
Directed Scale-Free Graphs / Bela Bollobas ; Christian Borgs ; Jennifer Chayes ; Oliver Riordan
The Cover Time of Sparse Random Graphs / Colin Cooper ; Alan Frieze
Perfect Matchings in Random Graphs with Prescribed Minimal Degree / Boris Pittel
Certifying Algorithms for Recognizing Interval Graphs and Permutation Graphs / Dieter Kratsch ; Ross M. McConnell ; Kurt Mehlhorn ; Jeremy P. SpinradSession 3C：
Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-up / Fedor V. Fomin ; Dimitrios M. Thilikos
Quick and Good Facility Location / Mikkel Thorup
Chain Decompositions and Independent Trees in 4-Connected Graphs / Sean Curran ; Orlando Lee ; Xingxing Yu
Optimizing Misdirection / Piotr Berman ; Piotr KrystaSession 4A：
Online Learning in Online Auctions / Avrim Blum ; Vijay Kumar ; Atri Rudra ; Felix Wu
An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents / Christos Papadimitriou ; Kunal Talwar ; Eva Tardos
Competitiveness via Consensus / Andrew V. Goldberg ; Jason D. Hartline
Pass Efficient Algorithms for Approximating Large Matrices / Petros Drineas ; Ravi KannanSession 4B：
Rangesum Histograms / S. Muthukrishnan ; Martin Strauss
Approximation of Functions over Redundant Dictionaries Using Coherence / Anna C. Gilbert ; Martin J. Strauss
Counting Inversions in Lists / Anupam Gupta ; Francis X. Zane
Certifying and Repairing Solutions to Large LPs: How Good Are LP-Solvers? / Marcel Dhiflaoui ; Stefan Funke ; Carsten Kwappik ; Michael Seel ; Elmar Schomer ; Ralph Schulte ; Dennis WeberSession 4C：
An Improved Approximation Algorithm for the O-Extension Problem / Jittat Fakcharoenphol ; Chris Harrelson ; Satish Rao
Packing Steiner Trees / Kamal Jain ; Mohammad Mahdian ; Mohammad R. Salavatipour
Integrality Ratio for Group Steiner Trees and Directed Steiner Trees / Eran Halperin ; Aravind Srinivasan ; Nan Wang
The Flow Complex: A Data Structure for Geometric Modeling / Joachim Giesen ; Matthias JohnSession 5A：
Graded Conforming Delaunay Tetrahedralization with Bounded Radius-Edge Ratio / Siu-Wing Cheng ; Sheung-Hung Poon
On the Combinatorial Complexity of Euclidean Voronoi Cells and Convex Hulls of d-Dimensional Spheres / Jean-Daniel Boissonnat ; Menelaos I. Karavelas
Perturbations and Vertex Removal in a 3D Delaunay Triangulation / Olivier Devillers ; Monique Teillaud
Root Comparison Techniques Applied to Computing the Additively Weighted Voronoi Diagram / Ioannis Z. Emiris
Random Walks on the Vertices of Transportation Polytopes with Constant Number of Sources / Mary Cryan ; Martin Dyer ; Haiko Muller ; Leen StougieSession 5B：
Smaller Explicit Superconcentrators / N. Alon ; M. Capalbo
A (1 + [epsilon])-Approximation Algorithm for Partitioning Hypergraphs Using a New Algorithmic Version of the Lovasz Local Lemma
A Spectral Technique for Random Satisfiable 3CNF Formulas / Abraham Flaxman
Random MAX SAT, Random MAX CUT, and Their Phase Transitions / Don Coppersmith ; David Gamarnik ; Mohammad Hajiaghayi ; Gregory B. Sorkin
Space-Efficient Finger Search on Degree-Balanced Search Trees / Guy E. Blelloch ; Bruce M. Maggs ; Shan Leung Maverick WooSession 5C：
Skip Graphs / James Aspnes ; Gauri Shah
Maintaining All-Pairs Approximate Shortest Paths under Deletion of Edges / Surender Baswana ; Ramesh Hariharan ; Sandeep Sen
A Faster and Simpler Fully Dynamic Transitive Closure / Liam Roditty
Data Streams: Algorithms and Applications / Session 6：
Sparse Distance Preservers and Additive Spanners / Session 7A：
Multi-Embedding and Path Approximation of Metric Spaces / Yair Bartal ; Manor Mendel
Approximation Algorithm for Embedding Metrics into a Two-Dimensional Space / Mihai Badoiu
On the Complexity of Distance-Based Evolutionary Tree Reconstruction / Valerie King ; Li Zhang ; Yunhong Zhou
Improved Results for Directed Multicut / Session 7B：
Algorithms for k-Colouring and Finding Maximal Independent Sets / Jesper Makholm Byskov
Equitable Colorings with Constant Number of Colors / S. V. Pemmaraju ; K. Nakprasit ; A. V. Kostochka
Better Performance Bounds for Finding the Smallest k-Edge Connected Spanning Subgraph of a Multigraph / Harold N. Gabow
A Note on the Set Systems Used for Broadcast Encryption / Alexander RussellSession 7C：
Lower Bounds for Collusion-Secure Fingerprinting / Chris Peikert ; Abhi Shelat ; Adam Smith
Quantum Property Testing / Harry Burhman ; Lance Fortnow ; Ilan Newman ; Hein Rohrig
Quantum Algorithms for Some Hidden Shift Problems / Wim van Dam ; Sean Hallgren ; Lawrence Ip
Simulataneous Optimization for Concave Costs: Single Sink Aggregation or Single Source Buy-at-Bulk / Ashish Goel ; Deborah EstrinSession 8A：
Non-independent Randomized Rounding / Benjamin Doerr
Minimizing Weighted Flow Time / N. Bansal ; K. Dhamdhere
A Combinatorial Algorithm for Computing a Maximum Independent Set in a t-Perfect Graph / Friedrich Eisenbrand ; Naveen Garg ; Jochen Konemann
Lower Bounds for Embedding Edit Distance into Normed Spaces / A. Andoni ; M. Deza ; A. Gupta ; P. Indyk ; S. RaskhodnikovaSession 8B：
Embedding k-Outerplanar Graphs into l[subscript 1] / Chandra Chekuri ; Yuri Rabinovich ; Alistair Sinclair
Embeddings and Non-approximability of Geometric Problems / Venkatesan Guruswami ; Piotr Indyk
Better Algorithms for High-Dimensional Proximity Problems via Asymmetric Embeddings / Session 8C：
Lower Bounds for External Memory Dictionaries / Gerth Stolting Brodal ; Rolf Fagerberg
Online Paging with Arbitrary Associativity / Enoch Peserico
The Set-Associative Cache Performance of Search Trees / James D. Fix
Computing Strongly Connected Components in a Linear Number of Symbolic Steps / Raffaella Gentilini ; Carla Piazza ; Alberto Policriti
On the Rectilinear Crossing Number of Complete Graphs / Uli WagnerSession 9A：
Matching Planar Maps / Helmut Alt ; Alon Efrat ; Gunter Rote ; Carola Wenk
Dynamic Generators of Topologically Embedded Graphs
Computing Homotopic Shortest Paths in the Plane / Sergei Bespamyatnikh
Fully-Dynamic Two Dimensional Orthogonal Range and Line Segment Intersection Reporting in Logarithmic Time / Christian Worm Mortensen
Edge Disjoint Paths Revisited / Session 9B：
A New Approximation Algorithm for the Asymmetric TSP with Triangle Inequality / Markus Blaser
Approximating Asymmetric Maximum TSP / Moshe Lewenstein ; Maxim Sviridenko
The k-Traveling Repairman Problem
Directed Graphs Requiring Large Numbers of Shortcuts / William Hesse
Implicit Dictionaries Supporting Searches and Amortized Updates in O(log n log log n) Time / Gianni Franceschini ; Roberto GrossiSession 9C：
Compact Representations of Separable Graphs / Daniel K. Blandford ; Ian A. Kash
Labeling Schemes for Small Distances in Trees / Stephen Alstrup ; Philip Bille ; Theis Rauhe
On AC[superscript 0] Implementations of Fusion Trees and Atomic Heaps
Who Cares about Permanents? / Persi DiaconisSession 10：
Between O(nm) and O(n[superscript alpha]) / Jeremy SpinradSession 11A：
Fast Distributed Algorithms for (Weakly) Connected Dominating Sets and Linear-Size Skeletons / Devdatt Dubhashi ; Alessandro Mei ; Alessandro Panconesi ; Jaikumar Radhakrishnan
A 5/4-Approximation Algorithm for Minimum 2-Edge-Connectivity / Raja Jothi ; Balaji Raghavachari ; Subramanian Varadarajan
Fault-Tolerant Facility Location / Chaitanya Swamy ; David B. Shmoys
Efficient Sequences of Trials / Edith Cohen ; Amos Fiat ; Haim KaplanSession 11B：
Pursuit-Evasion with Imprecise Target Location / Gunther Rote
Unconditional Proof of Tightness of Johnson Bound / Vendatesan Guruswami ; Igor Shparlinski
Deterministic Identity Testing for Multivariate Polynomials / Richard Lipton ; Nisheeth Vishnoi
Competitive Queueing Policies for QoS Switches / Nir Andelman ; Yishay Mansour ; An ZhuSession 11C：
Dynamic Routing on Networks with Fixed-Size Buffers / William Aiello ; Rafail Ostrovsky ; Eyal Kushilevitz ; Adi Rosen
Dynamic Construction of Bluetooth Scatternets of Fixed Degree and Low Diameter / Lali Barriere ; Pierre Fraigniaud ; Lata Narayanan ; Jaroslav Opatrny
Scheduling Techniques for Media-on-Demand / Amotz Bar-Noy ; Richard E. Ladner ; Tami Tamir
Smaller Core-Sets for Balls / Mihal Badoiu ; Kenneth L. ClarksonSession 12A：
Zonotopes as Bounding Volumes / Leonidas J. Guibas ; An Nguyen
Sublinear-Time Approximation of Euclidean Minimum Spanning Tree / Artur Czumaj ; Funda Ergun ; Avner Magen ; Ronitt Rubinfeld ; Christian Sohler
An Approximation Algorithm for Cutting Out Convex Polygons / Adrian Dumitrescu
Inferring Tree Topologies Using Flow Tests / Torsten Suel ; Radek VingralekSession 12B：
Wavelength Assignment and Generalized Interval Graph Coloring / Peter Winkler ; Lisa Zhang
An Improved Approximation Algorithm for the Partial Latin Square Extension Problem / Carla P. Gomes ; Rommel G. Regis
Multirate Rearrangeable Clos Networks and a Generalized Edge Coloring Problem on Bipartite Graphs / Hung Q. Ngo ; Van H. Vu
High-Order Entropy-Compressed Text Indexes / Ankur Gupta ; Jeffrey Scott VitterSession 12C：
Multidimensional Matching and Fast Search in Suffix Trees / Richard Cole
Inplace 2D Matching in Compressed Images / Amihood Amir ; Gad M. Landau ; Dina Sokol
The Similarity Metric / Ming Li ; Xin Chen ; Xin Li ; Bin Ma ; Paul Vitanyi
Author Index
Preface
Acknowledgments
In Memoriam
92.

図書
図書
92. Algorithms and computation : 13th International Symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002 : proceedings
Prosenjit Bose, Pat Morin (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  xiii, 656 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2518
所蔵情報: loading…
93.

図書
図書
93. Algorithmic learning theory : 13th International Conference, ALT 2002, Lübeck, Germany, November 24-26, 2002 : proceedings
Nicolò Cesa-Bianchi, Masayuki Numao, Rüdiger Reischuk (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  xi, 413 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2533 . Lecture notes in artificial intelligence
所蔵情報: loading…
94.

図書
図書
94. Algorithms, devices, and systems for optical information processing III : 20-21 July 1999, Denver, Colorado
Bahram Javidi, Demetri Psaltis, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c1999  vii, 258 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 3804
所蔵情報: loading…
95.

図書

東工大
目次DB
図書
東工大
目次DB
95. Algorithms and computation : 14th International Symposium, ISAAC 2003, Kyoto, Japan, December 15-17, 2003 : proceedings
Toshihide Ibaraki, Naoki Katoh, Hirotaka Ono (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xvii, 748 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2906
所蔵情報: loading…
目次情報: 続きを見る
Invited Talk
   Interactive Proofs for Quantum Computation Andrew Chi-Chih Yao 1
   Drawing Plane Graphs Takao Nishizeki 2
1A Computational Geometry I
   Linear Time Algorithm for Approximating a Curve by a Single-Peaked Curve Jinhee Chun, Kunihiko Sadakane, Takeshi Tokuyama 6
   A Dynamic Dictionary for Priced Information with Application Anil Maheshwari, Michiel Smid 16
   Voronoi Diagram in the Flow Field Tetsushi Nishida, Kokichi Sugihara 26
   Polygonal Path Approximation: A Query Based Approach Ovidiu Daescu, Ningfang Mi 36
1B Graph and Combinatorial Algorithms I
   A Vertex Incremental Approach for Dynamically Maintaining Chordal Graphs Anne Berry, Pinar Heggernes, Yngve Villanger 47
   Finding the Maximum Common Subgraph of a Partial κ-Tree and a Graph with a Polynomially Bounded Number of Spanning Trees Atsuko Yamaguchi, Hiroshi Mamitsuka 58
   Hotlink Enhancement Algorithms for Web Directories Ori Gerstel, Shay Kutten, Rachel Matichin, David Peleg 68
   Finding a Length-Constrained Maximum-Density Path in a Tree Rung-Ren Lin, Wen-Hsiung Kuo, Kun-Mao Chao 78
2A Computational Complexity I
   The Intractability of Computing the Hamming Distance Bodo Manthey, Ruediger Reischuk 88
   Infinitely-Often Autoreducible Sets Richard Beigel, Lance Fortnow, Frank Stephan 98
   Limiting Negations in Bounded-Depth Circuits: An Extension of Markov's Theorem Shao Chin Sung, Keisuke Tanaka 108
   Computational Complexity Measures of Multipartite Quantum Entanglement Tomoyuki Yamakami 117
2B Graph and Combinatorial Algorithms II
   A New Simple Algorithm for the Maximum-Weight Independent Set Problem on Circle Graphs Gabriel Valiente 129
   Polynomial Time 2-Approximation Algorithms for the Minmax Subtree Cover Probem Hiroshi Nagamochi, Kohei Okada 138
   Labeled Search Trees and Amortized Analysis: Improved Upper Bounds for NP-Hard Problems Jianer Chen, Iyad A. Kanj, Ge Xia 148
   A New Translation from Semi-extended Regular Expressions into NFAs and Its Application to an Approximate Matching Problem Hiroaki Yamamoto 158
3A Quantum Computation
   The Quantum Query Complexity of 0-1 Knapsack and Associated Claw Problems V. Arvind, Rainer Schuler 168
   Non-interactive Quantum Perfect and Statistical Zero-Knowledge Hirotada Kobayashi 178
   Quantum Merlin-Arthur Proof Systems: Are Multiple Merlins More Helpful to Arthur? Hirotada Kobayashi, Keiji Matsumoto, Tomoyuki Yamakami 189
   A Faster Lattice Reduction Method Using Quantum Search Christoph Ludwig 199
3B Graph and Combinatorial Algorithms III
   Three Sorting Algorithms Using Priority Queues Amr Elmasry 209
   Lower Bounds on Correction Networks Grzegorz Stachowiak 221
   Approximate Regular Expression Searching with Arbitrary Integer Weights Gonzalo Navarro 230
   Constructing Compressed Suffix Arrays with Large Alphabets Wing-Kai Hon, Tak-Wah Lam, Kunihiko Sadakane, Wing-Kin Sung 240
4A Computational Geometry II
   On the Geometric Dilation of Finite Point Sets Annette Ebbers-Baumann, Ansgar Gruene, Rolf Klein 250
   On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen 260
   Optimal Point Set Projections onto Regular Grids Jose Miguel Diaz-Banez, Ferran Hurtado, Mario Alberto Lopez, J. Antoni Sellares 270
4B Combinatorial Optimization I
   An Approximation Algorithm for Dissecting a Rectangle into Rectangles with Specified Areas Hiroshi Nagamochi, Yuusuke Abe 280
   A Faster Algorithm for Two-Variable Integer Programming Friedrich Eisenbrand, Soeren Laue 290
   Efficient Algorithms for Generation of Combinatorial Covering Suites Adrian Dumitrescu 300
5A Scheduling
   A Better Approximation for the Two-Machine Flowshop Scheduling Problem with Time Lags Yoshiyuki Karuno, Hiroshi Nagamochi 309
   On Minimizing Average Weighted Completion Time: A PTAS for the Job Shop Problem with Release Dates Aleksei V. Fishkin, Klaus Jansen, Monaldo Mastrolilli 319
   Online Scheduling of Parallel Jobs with Dependencies on 2-Dimensional Meshes Deshi Ye, Guochuan Zhang 329
5B Computational Biology
   Efficient Algorithms for Descendent Subtrees Comparison of Phylogenetic Trees with Applications to Co-evolutionary Classifications in Bacterial Genome Yaw-Ling Lin, Tsan-Sheng Hsu 339
   Settling the Intractability of Multiple Alignment Isaac Elias 352
   Efficient Algorithms for Optimizing Whole Genome Alignment with Noise T.W. Lam, N. Lu, H.F. Ting, Prudence W.H. Wong, S.M. Yiu 364
6A Computational Geometry III
   Segmenting Doughnut-Shaped Objects in Medical Images Xiaodong Wu 375
   On the Locality Properties of Space-Filling Curves H.K. Dai, H.C. Su 385
   Geometric Restrictions on Producible Polygonal Protein Chains Erik D. Demaine, Stefan Langerman, Joseph O'Rourke 395
   Symmetric Layout of Disconnected Graphs Seok-Hee Hong, Peter Eades 405
6B Graph and Combinatorial Algorithms IV
   Approximation Hardness of Minimum Edge Dominating Set and Minimum Maximal Matching Miroslav Chlebik, Janka Chlebikova 415
   Enumerating Global Roundings of an Outerplanar Graph Nadia Takki-Chebihi, Takeshi Tokuyama 425
   Augmenting Forests to Meet Odd Diameter Requirements Toshimasa Ishii, Shigeyuki Yamamoto, Hiroshi Nagamochi 434
   On the Existence and Determination of Satisfactory Partitions in a Graph Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten 444
7A Distributed and Parallel Algorithms
   A Turn Function Scheme Realized in the Asynchronous Single-Writer/Multi-reader Shared Memory Model Tom Altman, Yoshihide Igarashi, Michiko Omori 454
   An Optimal Parallel Algorithm for c-Vertex-Ranking of Trees Md. Abul Kashem, M. Ziaur Rahman 464
7B Graph and Combinatorial Algorithms V
   The Student-Project Allocation Problem David J. Abraham, Robert W. Irving, David F. Manlove 474
   Algorithms for Enumerating Circuits in Matroids Endre Boros, Khaled Elbassioni, Vladimir Gurvich, Leonid Khachiyan 485
   A Generalized Gale-Shapley Algorithm for a Discrete-Concave Stable-Marriage Model Akinobu Eguchi, Satoru Fujishige, Akihisa Tamura 495
8A Data Structure
   Succinct Data Structures for Searchable Partial Sums Wing-Kai Hon, Kunihiko Sadakane, Wing-Kin Sung 505
   Range Mode and Range Median Queries on Lists and Trees Danny Krizanc, Pat Morin, Michiel Smid 517
   Quasi-Perfect Minimally Adaptive q-ary Search with Unreliable Tests Ferdinando Cicalese, Christian Deppe 527
   New Ways to Construct Binary Search Trees Travis Gagie 537
8B Graph and Combinatorial Algorithms VI
   Improved Approximation Algorithms for Optimization Problems in Graphs with Superlogarithmic Treewidth Artur Czumaj, Andrzej Lingas, Johan Nilsson 544
   Biconnectivity on Symbolically Represented Graphs: A Linear Solution Raffaella Gentilini, Alberto Policriti 554
   A Dynamic Data Structure for Maintaining Disjoint Paths Information in Digraphs Torsten Tholey 565
   Deterministic Algorithm for the t-Threshold Set Problem Jeremy Barbay, Claire Kenyon 575
9A Combinatorial and Network Optimization
   Energy-Efficient Wireless Network Design Ioannis Caragiannis, Christos Kaklamanis, Panagiotis Kanellopoulos 585
   Wavelength Conversion in Shortest-Path All-Optical Networks Thomas Erlebach, Stamatis Stefanakos 595
   A Heuristic for the Stacker Crane Problem on Trees which Is Almost Surely Exact Amin Coja-Oghlan, Sven O. Krumke, Till Nierhoff 605
   Flexible Train Rostering Stephan Eidenbenz, Aris Pagourtzis, Peter Widmayer 615
9B Computational Complexity and Cryptography
   Counting Complexity Classes over the Reals I: The Additive Case Peter Buergisser, Felipe Cucker 625
   Some Properties of One-Pebble Turing Machines with Sublogarithmic Space Atsuyuki Inoue, Akira Ito, Katsushi Inoue, Tokio Okazaki 635
   Hypergraph Decomposition and Secret Sharing Giovanni Di Crescenzo, Clemente Galdi 645
   A Promising Key Agreement Protocol Eun-Kyung Ryu, Kee-Won Kim, Kee-Young Yoo 655
10A Game Theory and Randomized Algorithm
   Rapid Mixing of Several Markov Chains for a Hard-Core Model Ravi Kannan, Michael W. Mahoney, Ravi Montenegro 663
   Polynomial Time Approximate Sampler for Discretized Dirichlet Distribution Tomomi Matsui, Mitsuo Motoki, Naoyuki Kamatani 676
   Fair Cost Allocations under Conflicts - A Game-Theoretic Point of View - Yoshio Okamoto 686
   Equilibria for Networks with Malicious Users George Karakostas, Anastasios Viglas 696
10B Algebraic and Arithmetic Computation
   Quasi-optimal Arithmetic for Quaternion Polynomials Martin Ziegler 705
   Upper Bounds on the Complexity of Some Galois Theory Problems V. Arvind, Piyush P Kurur 716
   Unfolded Modular Multiplication Wieland Fischer, Jean-Pierre Seifert 726
   Gauss Period, Sparse Polynomial, Redundant Basis, and Efficient Exponentiation for a Class of Finite Fields with Small Characteristic Soonhak Kwon, Chang Hoon Kim, Chun Pyo Hong 736
Author Index 747
Invited Talk
   Interactive Proofs for Quantum Computation Andrew Chi-Chih Yao 1
   Drawing Plane Graphs Takao Nishizeki 2
96.

図書
図書
96. Theory and applications of satisfiability testing : 6th International Conference, SAT 2003, Santa Margherita Ligure, Italy, May 5-8, 2003 : selected revised papers
Enrico Giunchiglia, Armando Tacchella (eds.)
出版情報: Berlin : Springer, c2004  xi, 530 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2919
所蔵情報: loading…
目次情報: 続きを見る
Satisfiability and Computing van der Waerden Numbers / Michael R. Dransfield ; Victor W. Marek ; Miroslaw Truszczynski
An Algorithm for SAT Above the Threshold / Hubie Chen
Watched Data Structures for QBF Solvers / Ian Gent ; Enrico Giunchiglia ; Massimo Narizzano ; Andrew Rowley ; Armando Tacchella
How Good Can a Resolution Based SAT-solver Be? / Eugene Goldberg ; Yakov Novikov
A Local Search SAT Solver Using an Effective Switching Strategy and an Efficient Unit Propagation / Xiao Yu Li ; Matthias F. Stallmann ; Franc Brglez
Density Condensation of Boolean Formulas / Youichi Hanatani ; Takashi Horiyama ; Kazuo Iwama
SAT Based Predicate Abstraction for Hardware Verification / Edmund Clarke ; Muralidhar Talupur ; Helmut Veith ; Dong Wang
On Boolean Models for Quantified Boolean Horn Formulas / Hans Kleine Büning ; K. Subramani ; Xishun Zhao
Local Search on SAT-encoded Colouring Problems / Steven Prestwich
A Study of Pure Random Walk on Random Satisfiability Problems with "Physical" Methods / Guilhem Semerjian ; Remi Monasson
Hidden Threshold Phenomena for Fixed-Density SAT-formulae / Hans van Maaren ; Linda van Norden
Improving a Probabilistic 3-SAT Algorithm by Dynamic Search and Independent Clause Pairs / Sven Baumer ; Rainer Schuler
Width-Based Algorithms for SAT and CIRCUIT-SAT / Elizabeth Broering ; Satyanarayana V. Lokam
Linear Time Algorithms for Some Not-All-Equal Satisfiability Problems / Stefan Porschen ; Bert Randerath ; Ewald Speckenmeyer
On Fixed-Parameter Tractable Parameterizations of SAT / Stefan Szeider
On the Probabilistic Approach to the Random Satisfiability Problem / Giorgio Parisi
Comparing Different Prenexing Strategies for Quantified Boolean Formulas / Uwe Egly ; Martina Seidl ; Hans Tompits ; Stefan Woltran ; Michael Zolda
Solving Error Correction for Large Data Sets by Means of a SAT Solver / Renato Bruni
Using Problem Structure for Efficient Clause Learning / Ashish Sabharwal ; Paul Beame ; Henry Kautz
Abstraction-Driven SAT-based Analysis of Security Protocols / Alessandro Armando ; Luca Compagna
A Case for Efficient Solution Enumeration / Sarfraz Khurshid ; Darko Marinov ; Ilya Shlyakhter ; Daniel Jackson
Cache Performance of SAT Solvers: a Case Study for Efficient Implementation of Algorithms / Lintao Zhang ; Sharad Malik
Local Consistencies in SAT / Christian Bessière ; Emmanuel Hebrard ; Toby Walsh
Guiding SAT Diagnosis with Tree Decompositions / Per Bjesse ; James Kukula ; Robert Damiano ; Ted Stanion ; Yunshan Zhu
On Computing k-CNF Formula Properties / Ryan Williams
Effective Preprocessing with Hyper-Resolution and Equality Reduction / Fahiem Bacchus ; Jonathan Winter
Read-Once Unit Resolution
The Interaction Between Inference and Branching Heuristics / Lyndon Drake ; Alan Frisch
Hypergraph Reductions and Satisfiability Problems / Daniele Pretolani
SBSAT: a State-Based, BDD-Based Satisfiability Solver / John Franco, Michal Kouril ; John Schlipf ; Jeffrey Ward ; Sean Weaver ; Michael Dransfield ; W. Mark Vanfleet
Computing Vertex Eccentricity in Exponentially Large Graphs: QBF Formulation and Solution / Maher Mneimneh ; Karem Sakallah
The Combinatorics of Conflicts between Clauses / Oliver Kullmann
Conflict-Based Selection of Branching Rules / Marc Herbstritt ; Bernd Becker
The Essentials of the SAT 2003 Competition / Daniel Le Berre ; Laurent Simon
Challenges in the QBF Arena: the SAT'03 Evaluation of QBF Solvers
kcnfs: an Efficient Solver for Random k-SAT Formulae / Gilles Dequen ; Olivier Dubois
An Extensible SAT-solver / Niklas Eén ; Niklas Sörensson
Survey and Belief Propagation on Random K-SAT / Alfredo Braunstein ; Riccardo Zecchina
Author Index
Satisfiability and Computing van der Waerden Numbers / Michael R. Dransfield ; Victor W. Marek ; Miroslaw Truszczynski
An Algorithm for SAT Above the Threshold / Hubie Chen
Watched Data Structures for QBF Solvers / Ian Gent ; Enrico Giunchiglia ; Massimo Narizzano ; Andrew Rowley ; Armando Tacchella
97.

図書
図書
97. Proceedings of the Fifteenth 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, c2004  xvi, 1132 p. ; 28 cm
所蔵情報: loading…
98.

図書
図書
98. Algorithms in bioinformatics : third International Workshop, WABI 2003, Budapest, Hungary, September 15-20, 2003 : proceedings
Gary Benson, Roderic Page (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  x, 528 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2812 . Lecture notes in bioinformatics
所蔵情報: loading…
目次情報: 続きを見る
Comparative Genomics
A Local Chaining Algorithm and Its Applications in Comparative Genomics / M.I. Abouelhoda ; E. Ohlebusch
Common Intervals of Two Sequences / G. Didier
Database Searching
A Systematic Statistical Analysis of Ion Trap Tandem Mass Spectra in View of Peptide Scoring / J. Colinge ; A. Masselot ; J. Magnin
Vector Seeds: An Extension to Spaced Seeds Allows Substantial Improvements in Sensitivity and Specificity / B. Brejová ; D.G. Brown ; T. Vinař
Gene Finding and Expression
A Stochastic Approach to Count RNA Molecules Using DNA Sequencing Methods / B. Hollas ; R. Schuler
A Method to Detect Gene Structure and Alternative Splice Sites by Agreeing ESTs to a Genomic Sequence / P. Bonizzoni ; G. Pesole ; R. Rizzi
Optimal DNA Signal Recognition Models with a Fixed Amount of Intrasignal Dependency
Genome Mapping
New Algorithm for the Simplified Partial Digest Problem / J. Błażewicz ; M. Jaroszewski
Noisy Data Make the Partial Digest Problem NP-hard / M. Cieliebak ; S. Eidenbenz ; P. Penna
Pattern and Motif Discovery
Pattern Discovery Allowing Wild-Cards, Substitution Matrices, and Multiple Score Functions / A. Mancheron ; I. Rusu
A Combinatorial Approach to Automatic Discovery of Cluster-Patterns / R. Eres ; G.M. Landau ; L. Parida
Dynamic Programming Algorithms for Two Statistical Problems in Computational Biology / S. Rahmann
Phylogenetic Analysis
Consensus Networks: A Method for Visualising Incompatibilities in Collections of Trees / B. Holland ; V. Moulton
Efficient Generation of Uniform Samples from Phylogenetic Trees / P. Kearney ; J.I. Munro ; D. Phillips
New Efficient Algorithm for Detection of Horizontal Gene Transfer Events / A. Boc ; V. Makarenkov
Ancestral Maximum Likelihood of Evolutionary Trees Is Hard / L. Addario-Berry ; B. Chor ; M. Hallett ; J. Lagergren ; A. Panconesi ; T. Wareham
A Linear-Time Majority Tree Algorithm / N. Amenta ; F. Clarke ; K. St. John
Bayesian Phylogenetic Inference under a Statistical Insertion-Deletion Model / G. Lunter ; I. Miklós ; A. Drummond ; J.L. Jensen ; J. Hein
Better Hill-Climbing Searches for Parsimony / G. Ganapathy ; V. Ramachandran ; T. Warnow
Computing Refined Buneman Trees in Cubic Time / G.S. Brodal ; R. Fagerberg ; A. Östlin ; C.N.S. Pedersen ; S.S. Rao
Distance Corrections on Recombinant Sequences / D. Bryant ; D. Huson ; T. Kloepper ; K. Nieselt-Struwe
Parsimonious Reconstruction of Sequence Evolution and Haplotype Blocks / Y.S. Song
Polymorphism
Identifying Blocks and Sub-populations in Noisy SNP Data / G. Kimmel ; R. Sharan ; R. Shamir
Designing Optimally Multiplexed SNP Genotyping Assays / Y. Aumann ; E. Manisterski ; Z. Yakhini
Minimum Recombinant Haplotype Configuration on Tree Pedigrees / K. Doi ; J. Li ; T. Jiang
Protein Structure
Efficient Energy Computation for Monte Carlo Simulation of Proteins / I. Lotan ; F. Schwarzer ; J.-C. Latombe
Speedup LP Approach to Protein Threading via Graph Reduction / J. Xu
Homology Modeling of Proteins Using Multiple Models and Consensus Sequence Alignment / J.C. Prasad ; M. Silberstein ; C.J. Camacho ; S. Vajda
Side-Chain Structure Prediction Based on Dead-End Elimination: Single Split DEE-criterion Implementation and Elimination Power / J.A. Spriet
Sequence Alignment
A Large Version of the Small Parsimony Problem / J. Fredslund ; T. Scharling
Optimal Multiple Parsimony Alignment with Affine Gap Cost Using a Phylogenetic Tree / B. Knudsen
Composition Alignment / G. Benson
String Algorithms
Match Chaining Algorithms for cDNA Mapping / T. Shibuya ; I. Kurochkin
Sequencing from Compomers: Using Mass Spectrometry for DNA De-Novo Sequencing of 200+ nt / S. Böcker
Bounds for Resequencing by Hybridization / D. Tsur
Selecting Degenerate Multiplex PCR Primers / R. Souvenir ; J. Buhler ; G. Stormo ; W. Zhang
Author Index
Comparative Genomics
A Local Chaining Algorithm and Its Applications in Comparative Genomics / M.I. Abouelhoda ; E. Ohlebusch
Common Intervals of Two Sequences / G. Didier
99.

図書
図書
99. Algorithms -- ESA 2003 : 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003 : proceedings
Giuseppe Di Battista, Uri Zwick (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xiv, 790 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2832
所蔵情報: loading…
100.

図書
図書
100. Algorithmic learning theory : 14th International Conference, ALT 2003, Sapporo, Japan, October 17-19, 2003 : proceedings
Ricard Gavaldà, Klaus P. Jantke, Eiji Takimoto (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xi, 312 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2842 . Lecture notes in artificial intelligence
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼