close
1.

図書

図書
Rolf Möhring, Rajeev Raman (eds.)
出版情報: Berlin : Springer, c2002  xiv, 917 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2461
所蔵情報: loading…
2.

図書

図書
Roderic Guigó, Dan Gusfield (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  x, 554 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2452
所蔵情報: loading…
3.

図書

図書
Klaus Jansen, Stefano Leonardi, Vijay Vazirani (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  viii, 269 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2462
所蔵情報: loading…
4.

図書

図書
Alberto Apostolico, Masayuki Takeda (eds.)
出版情報: Berlin : Springer, c2002  viii, 288 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2373
所蔵情報: loading…
5.

図書

図書
David M. Mount, Clifford Stein (eds.)
出版情報: Berlin : Springer, c2002  viii, 205 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2409
所蔵情報: loading…
6.

図書

図書
Naoki Abe, Roni Khardon, Thomas Zeugmann (eds.)
出版情報: Berlin ; New York : Springer, c2001  xi, 377 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2225 . Lecture notes in artificial intelligence
所蔵情報: loading…
目次情報: 続きを見る
EditorsÆ Introduction / N. Abe ; R. Khardon ; T. Zeugmann
Invited Papers
The Discovery Science Project in Japan / S. Arikawa
Queries Revisited / D. Angluin
Robot Baby 2001 / P.R. Cohen ; T. Oates ; N. Adams ; C.R. Beal
Discovering Mechanisms: A Computational Philosophy of Science Perspective / L. Darden
Inventing Discovery Tools: Combining Information Visualization with Data Mining / B. Shneiderman
Complexity of Learning
On Learning Correlated Boolean Functions Using Statistical Queries / K. Yang
A Simpler Analysis of the Multi-way Branching Decision Tree Boosting Algorithm / K. Hatano
Minimizing the Quadratic Training Error of a Sigmoid Neuron Is Hard / J. &Scron;ima
Support Vector Machines
Learning of Boolean Functions Using Support Vector Machines / K. Sadohara
A Random Sampling Technique for Training Support Vector Machines (For Primal-Form Maximal-Margin Classifiers) / J. Balcázar ; Y. Dai ; O. Watanabe
New Learning Models
Learning Coherent Concepts / A. Garg ; D. Roth
Learning Intermediate Concepts / S.S. Kwek
Real-Valued Multiple-Instance Learning with Queries / D.R. Dooly ; S.A. Goldman
Online Learning
Loss Functions, Complexities, and the Legendre Transformation / Y. Kalnishkan ; M.V. Vyugin ; V. Vovk
Non-linear Inequalities between Predictive and Kolmogorov Complexities / V.V. V'yugin
Inductive Inference
Learning by Switching Type of Information / S. Jain ; F. Stephan
Learning How to Separate
Learning Languages in a Union / Y.K. Ng ; T.S. Tay
On the Comparison of Inductive Inference Criteria for Uniform Learning of Finite Classes / S. Zilles
Refutable Inductive Inference
Refutable Language Learning with a Neighbor System / Y. Mukouchi ; M. Sato
Learning Recursive Functions Refutably / E. Kinber ; R. Wiehagen
Refuting Learning Revisited / W. Merkle
Learning Structures and Languages
Efficient Learning of Semi-structured Data from Queries / H. Arimura ; H. Sakamoto
Extending Elementary Formal Systems / S. Lange ; G. Grieser ; K.P. Jantke
Learning Regular Languages Using RFSA / F. Denis ; A. Lemay ; A. Terlutte
Inference of ?-Languages from Prefixes / C. de la Higuera ; J.-C. Janodet
Author Index
EditorsÆ Introduction / N. Abe ; R. Khardon ; T. Zeugmann
Invited Papers
The Discovery Science Project in Japan / S. Arikawa
7.

図書

図書
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
8.

図書

図書
Peter Eades, Tadao Takaoka (eds.)
出版情報: Berlin : Springer, c2001  xiv, 780 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2223
所蔵情報: loading…
9.

図書

図書
Svetozar Margenov, Jerzy Waśniewski, Plamen Yalamov (eds.)
出版情報: Berlin : Springer, c2001  xi, 498 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2179
所蔵情報: loading…
10.

図書

図書
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…
11.

図書

図書
Amihood Amir, Gad M. Landau (eds.)
出版情報: Berlin : Springer, c2001  viii, 271 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2089
所蔵情報: loading…
目次情報: 続きを見る
Regular Expression Searching over Ziv-Lempel Compressed Text / Gonzalo Navarro
Parallel Lempel Ziv Coding (Extended Abstract) / Shmuel Tomi Klein ; Yair Wiseman
Approximate Matching of Run-Length Compressed Strings / Veli Mäkinen ; Esko Ukkonen
What to Do with All this Hardware? (Invited Lecture) / Uzi Vishkin
Efficient Experimental String Matching by Weak Factor Recognition / Cyril Allauzen ; Maxime Crochemore ; Mathieu Raffinot
Better Filtering with Gapped q-Grams / Stefan Burkhardt ; Juha Kärkkäinen
Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) / Abraham Bookstein ; Timo Raita
An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) / Aviezri S. Fraenkel ; Jamie Simpson
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory / Anne Bergeron
Tandem Cyclic Alignment / Gary Benson
An Output-Sensitive Flexible Pattern Discovery Algorithm / Laxmi Parida ; Isidore Rigoutsos ; Dan Platt
Episode Matching / Zdenek Tronícek
String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music / Masayuki Takeda
Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) / Hiroki Arimura ; Hiroki Asaka ; Hiroshi Sakamoto ; Setsuo Arikawa
On-Line Construction of Compact Directed Acyclic Word Graphs / Jean-Marc Champarnaud ; Djelloul Ziadi ; Shunsuke Inenaga ; Hiromasa Hoshino ; Ayumi Shinohara ; Giancarlo Mauri ; Giulio Pavesi
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications / Toru Kasai ; Gunho Lee ; Kunsoo Park
Multiple Pattern Matching Algorithms on Collage System / Takuya Kida ; Tetsuya Matsumoto
Finding All Common Intervals of k Permutations / Steffen Heber ; Jens Stoye
Generalized Pattern Matching and the Complexity of Unavoidability Testing / Christine E. Heitsch
Balanced Suffix Trees (Invited Lecture) / S. Rao Kosaraju
A Fast Algorithm for Optimal Alignment between Similar Ordered Trees / Jesper Jansson ; Andrzej Lingas
Minimum Quartet Inconsistency Is Fixed Parameter Tractable / Jens Gramm ; Rolf Niedermeier
Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC / Rolf Backofen ; Sebastian Will
Author Index
Regular Expression Searching over Ziv-Lempel Compressed Text / Gonzalo Navarro
Parallel Lempel Ziv Coding (Extended Abstract) / Shmuel Tomi Klein ; Yair Wiseman
Approximate Matching of Run-Length Compressed Strings / Veli Mäkinen ; Esko Ukkonen
12.

図書

図書
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, c2002  xiv, 1004 p. ; 28 cm
所蔵情報: loading…
13.

図書

図書
Friedhelm Meyer auf der Heide (ed.)
出版情報: Berlin : Springer, c2001  xii, 538 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2161
所蔵情報: loading…
14.

図書

図書
Adam L. Buchsbaum, Jack Snoeyink (eds.)
出版情報: Berlin : Springer, c2001  viii, 229 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2153
所蔵情報: loading…
15.

図書

図書
Fahiem Bacchus, Toby Walsh (eds.)
出版情報: Berlin : Springer, c2005  xii, 492 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3569
所蔵情報: loading…
16.

図書

図書
Alberto Apostolico, Maxime Crochemore, Kunsoo Park (eds.)
出版情報: Berlin : Springer, c2005  xi, 444 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3537
所蔵情報: loading…
17.

図書

図書
Hongbo Li, Peter J. Olver, Gerald Sommer (eds.)
出版情報: Berlin : Springer, c2005  ix, 447 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3519
所蔵情報: loading…
18.

図書

図書
Holger H. Hoos, David G. Mitchell (eds.)
出版情報: Berlin : Springer, c2005  xiii, 392 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3542
所蔵情報: loading…
19.

図書

図書
Frank Dehne, Alejandro López-Ortiz, Jörg-Rüdiger Sack (eds.)
出版情報: Berlin ; Tokyo : Springer, c2005  xiv, 446 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3608
所蔵情報: loading…
20.

図書

図書
Edmund G. Zelnio, Frederick D. Garber, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering ; cooperating organizations, Ball Aerospace & Technologies Corporation (USA), College of Optics and Photonics/University of Central Florida (USA), Florida Space Institute (USA), FOI -- Swedish Defense Research Agency (Sweden), University of Central Florida (USA)
出版情報: Bellingham, Wash. : SPIE, c2005  viii, 470 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v.5808
所蔵情報: loading…
21.

図書

図書
Shai Ben-David, John Case, Akira Maruoka (eds.)
出版情報: Berlin : Springer, c2004  xiv, 504 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3244 . Lecture notes in artificial intelligence
所蔵情報: loading…
22.

図書

図書
Stefano Leonardi (ed.)
出版情報: Berlin : Springer-Verlag, c2004  viii, 187 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3243
所蔵情報: loading…
23.

図書

図書
Sotiris E. Nikoletseas (ed.)
出版情報: Berlin ; Tokyo : Springer, c2005  xv, 624 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3503
所蔵情報: loading…
24.

図書

図書
Inge Jonassen, Junhyong Kim (eds.)
出版情報: Berlin : Springer, c2004  ix, 476 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3240 . Lecture notes in bioinformatics
所蔵情報: loading…
25.

図書

図書
Susanne Albers, Tomasz Radzik (eds.)
出版情報: Berlin : Springer, c2004  xviii, 836 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3221
所蔵情報: loading…
26.

図書

図書
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…
27.

図書

図書
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…
28.

図書

図書
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…
29.

図書

図書
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:
30.

図書

図書
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…
31.

図書

図書
Hon Wai Leong, Hiroshi Imai, Sanjay Jain (eds.)
出版情報: Berlin ; Tokyo : Springer, c1997  xv, 426 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1350
所蔵情報: loading…
32.

図書

図書
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
33.

図書

図書
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
34.

図書

図書
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):
35.

図書

図書
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
36.

図書

図書
Carme Àlvarez, Maria Serna (eds.)
出版情報: Berlin : Springer, c2006  xi, 327 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4007
所蔵情報: loading…
37.

図書

図書
Yossi Azar, Thomas Erlebach (eds.)
出版情報: Berlin : Springer, c2006  xviii, 843 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4168
所蔵情報: loading…
38.

図書

図書
Hans L. Bodlaender, Michael A. Langston (eds.)
出版情報: Berlin : Springer, c2006  xi, 277 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 4169
所蔵情報: loading…
39.

図書

図書
Martin Farach-Colton (ed.)
出版情報: Berlin : Springer, c1998  viii, 250 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1448
所蔵情報: loading…
40.

図書

図書
Gerth Stølting Brodal, Stefano Leonardi (eds.)
出版情報: Berlin : Springer, c2005  xviii, 901 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3669
所蔵情報: loading…
41.

図書

図書
Sanjay Jain, Hans Ulrich Simon, Etsuji Tomita (eds.)
出版情報: Berlin : Springer, c2005  xii, 489 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3734 . Lecture notes in artificial intelligence
所蔵情報: loading…
42.

図書

図書
Rita Casadio, Gene Myers (eds.)
出版情報: Berlin : Springer, c2005  x, 436 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3692 . Lecture notes in bioinformatics
所蔵情報: loading…
43.

図書

図書
John Schewel ... [et al.], chairs/editors ; sponsored ... by SPIE--the International Society for Optical Engineering ; cooperating organization, Colorado Photonics Industry Association (USA)
出版情報: Bellingham, Wash., USA : SPIE, c2001  v, 174 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 4525
所蔵情報: loading…
44.

図書

図書
John Schewel ... [et al.], chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Washington : SPIE, c2002  v, 126 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 4867
所蔵情報: loading…
45.

図書

図書
Bahram Javidi, Demetri Psaltis, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Washington : SPIE, c2000  vii, 330 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 4471
所蔵情報: loading…
46.

図書

図書
Bahram Javidi, Demetri Psaltis, chairs/editors ; sponsored and published by SPIE--the International Society for Optical Engineering ; cooperating organizations, the Boeing Company (USA)
出版情報: Bellingham, Washington : SPIE, c2002  viii, 312 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 4789
所蔵情報: loading…
47.

図書

図書
A. Evan Iverson, chair/editor ; sponsored and published by SPIE--the International Society for Optical Engineering
出版情報: Bellingham, Wash. : SPIE, c1996  vii, 402 p. ; 28 cm
シリーズ名: Proceedings / SPIE -- the International Society for Optical Engineering ; v. 2758
所蔵情報: loading…
目次情報: 続きを見る
Improving the performance of genetic algorithms for terrain categorization of multispectral images / David E. Larch
Segmentation of multiband imagery using minimum spanning trees / James R. Lersch ; A. Evan Iverson ; Brian N. Webb ; Karen F. West
Spectral shape classification system for Landsat thematic mapper / Mark J. Carlotto
Nonparametric classification of subpixel materials in multispectral imagery / Eric R. Boudreau ; Robert L. Huguenin ; Mark Karaska
Using maps to automate the classification of remotely sensed imagery
Automatic neural network-based cloud detection/classification scheme using multispectral and textural features / Mukhtiar A. Shaikh ; Bin Tian ; Mahmood R. Azimi-Sadjadi ; Kenneth E. Eis ; Thomas H. Vonder Haar
Small-target detection in multispectral imagery with cyclic overlay processing / Mark S. Schmalz ; Wen-Chen Hu ; Gerhard X. Ritter
Subpixel material identification by residual correlation / Pamela L. Blake ; Gerald Pellegrini ; Mark R. Vriesenga
Nonlinear unmixing of simulated MightySat FTHSI data for target detection limits in a humid tropical forest scene / Frederick P. Portigal ; Leonard J. Otten
Automated map generation and update from high-resolution multispectral imagery / Michael E. Bullock ; Scott R. Fairchild ; Tim J. Patterson ; Robert S. Haxton
Automatic extraction and identification of lines of communication from high-resolution multispectral imagery / Herbert A. Stevenson
Toward automation of the extraction of lines of communication from multispectral images using a spatiospectral extraction technique / Terrence H. Hemmer
Analysis of the computed-tomography imaging spectrometer by singular-value decomposition / Michael R. Descour ; Robert A. Schowengerdt ; Eustace L. Dereniak
Evaluating an image-fusion algorithm with synthetic image generation tools / Harry N. Gross ; John R. Schott
Fusion of airborne hyperspectral and multispectral images / Boris Zhukov ; Dieter Oertel ; Peter Strobl ; Frank Lehmann ; Manfred Lehner
Multispectral image resolution enhancement to improve efficiency of spectral-analysis algorithms / Roberto Aloisi ; Yvan Grabit
Quantitative comparison of multispectral image-sharpening algorithms / Stephen B. Ulinski
Improved cross-sensor resolution enhancement for landcover products / Todd A. Jamison ; Ernest A. Carroll
Cross-sensor resolution enhancement of hyperspectral images using wavelet decomposition / Laurent Peytavin
Nonlinear mean-square estimation with applications in remote sensing
Water vapor retrieval over many surface types / Christoph C. Borel ; William B. Clodius ; Jennifer Johnson
Multisensor evaluation research: enhancement techniques and sensor evaluation results / Gary Duncan ; William H. Heidbreder ; James Hammack ; Casimir Szpak
Accurate top-of-the-atmosphere albedo determination from multiple views of the MISR instrument / Siegfried A. Gerstl ; Carmen Tornow
Atmospheric correction with haze removal including a haze/clear transition region / Rudolf Richter
Adaptive multispectral normalization system / Mary R. Lawler-Covell ; Michael W. Kiefer ; Sarah M. Officer ; Michael J. Price
Radiometric calibration archive for Landsat Thematic Mapper (TM) / Dennis L. Helder
Fractal geometry for atmospheric correction and canopy simulation
In-flight refocusing of the SPOT-1 HRV cameras / Aime Meygret ; Dominique Leger
POLDER level-1 processing algorithms / Olivier Hagolle ; Agnes Guerry ; Laurent Cunin ; Bruno Millet ; Jacqueline Perbos ; Jean-Marc Laherrere ; Thierry Bret-Dibat ; Laurent Poutier
Real-time processing of midwave-infrared imaging spectrometer data / Richard Preston ; Mark C. Norton ; Robert W. Crow
Evaluation of onboard hyperspectral-image-compression techniques for a parallel push-broom sensor / Scott D. Briles
Image reconstruction algorithms for DOIS: a diffractive optic image spectrometer / Denise M. Lyons ; Kevin Whitcomb
HYDICE postflight data processing / William S. Aldrich ; Mary E. Kappus ; Ronald G. Resmini ; Peter A. Mitchell
Calibration of MODTRAN3 with PGAMS observational data for atmospheric correction applications / Stephen Schiller ; Jeffery C. Luvall ; Jere Justus
Preprocessing for the digital airborne imaging spectrometer DAIS 7915 / Andreas Mueller
Image correction and data quality control for the modular optoelectronic multispectral/stereo scanner MOMS 02
Atmospheric correction of DAIS hyperspectral image data
Improving the performance of genetic algorithms for terrain categorization of multispectral images / David E. Larch
Segmentation of multiband imagery using minimum spanning trees / James R. Lersch ; A. Evan Iverson ; Brian N. Webb ; Karen F. West
Spectral shape classification system for Landsat thematic mapper / Mark J. Carlotto
48.

図書

図書
Suleyman Cenk Sahinalp, S. Muthukrishnan, Ugur Dogrusoz (eds.)
出版情報: Berlin ; Tokyo : Springer, c2004  xi, 486 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3109
所蔵情報: loading…
49.

図書

図書
Rudolf Fleischer, Gerhard Trippen (eds.)
出版情報: Berlin : Springer, c2004  xvii, 935 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3341
所蔵情報: loading…
50.

図書

図書
Klaus Jansen, Samir Khuller (eds.)
出版情報: Berlin : Springer, c2000  ix, 273 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1913
所蔵情報: loading…
51.

図書

図書
Hiroki Arimura, Sanjay Jain, Arun Sharma (eds.)
出版情報: Berlin ; New York : Springer, c2000  xi, 333 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1968 . Lecture notes in artificial intelligence
所蔵情報: loading…
52.

図書

図書
D.T. Lee, Shang-Hua Teng (eds.)
出版情報: Berlin ; New York : Springer, c2000  xiv, 578 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1969
所蔵情報: loading…
目次情報: 続きを見る
Invited Presentations
Voronoi-Based Systems of Coordinates and Surface Reconstruction / Jean-Daniel Boissonnat
Essentially Every Unimodular Matrix Defines an Expander / Jin-Yi Cai
Algorithms and Data Structures (I)
Strategies for Hotlink Assignments / Prosenjit Bose ; Evangelos Kranakis ; Danny Krizanc ; Jurek Czyzowicz ; Andrzej Pelc ; Leszek Gasieniec ; Miguel V. Martin
A New Competitive Analysis of Randomized Caching / Ching Law ; Charles E. Leiserson
Online Routing in Convex Subdivisions / Pat Morin ; Andrej Brodnik ; Svante Carlsson ; Erik D. Demaine ; Rudolf Fleischer ; J. Ian Munro ; Alejandro López-Ortiz
Combinatorial Optimization
A Simple Linear-Time Approximation Algorithm for Multi-processor Job Scheduling on Four Processors / Jingui Huang ; Jianer Chen ; Songqiao Chen
Classification of Various Neighborhood Operations for the Nurse Scheduling Problem / Takayuki Osogami ; Hiroshi Imai
Optimal Bid Sequences for Multiple-Object Auctions with Unequal Budgets / Yuyu Chen ; Ming-Yang Kao ; Hsueh-I. Lu
Algorithms and Data Structures (II)
Coping with Delays and Time-Outs in Binary Search Procedures / Ferdinando Cicalese ; Ugo Vaccaro
Some Formal Analysis of Rocchio's Similarity-Based Relevance Feedback Algorithm / Zhixiang Chen ; Binhai Zhu
Reasoning with Ordered Binary Decision Diagrams / Takashi Horiyama ; Toshihide Ibaraki
Approximation and Randomized Algorithms (I)
On Approximating Minimum Vertex Cover for Graphs with Perfect Matching / Iyad A. Kanj
A 2-Approximation Algorithm for Path Coloring on Trees of Rings / Xiaotie Deng ; Yi Zhou ; Guojun Li ; Wenan Zang
An Approximate Algorithm for the Weighted Hamiltonian Path Completion Problem on a Tree / Q. S. Wu ; C. L. Lu ; R. C. T. Lee
Algorithms and Data Structures (III)
Finding Independent Spanning Trees in Partial k-Trees / Xiao Zhou ; Takao Nishizeki
On Efficient Fixed Parameter Algorithms for Weighted Vertex Cover / Rolf Niedermeier ; Peter Rossmanith
Constructive Linear Time Algorithms for Small Cutwidth and Carving-Width / Dimitros M. Thilikos, Maria J. Serna ; Hans L. Bodlaender
Approximation and Randomized Algorithms (II)
Approximation Algorithms for the Maximum Power Consumption Problem on Combinatorial Circuits / Takao Asano ; Magnús M. Halldórsso ; Kazuo Iwama ; Takeshi Matsuda
A Simple and Quick Approximation Algorithm for Traveling Salesman Problem in the Plane / Norihiro Kubo ; Shinichi Shimozono ; Katsuhiro Muramoto
Simple Algorithms for a Weighted Interval Selection Problem / Thomas Erlebach ; Frits C. R. Spieksma
Graph Drawing and Algorithms
Efficient Minus and Signed Domination in Graphs / Chin L. Lu ; Sheng-Lung Peng ; Chuan Y. Tang
Convex Grid Drawings of Four-Connected Plane Graphs / Kazuyuki Miura ; Shin-ichi Nakano
An Algorithm for Finding Three-Dimensional Symmetry in Series-Parallel Digraphs / Seok-Hee Hong ; Peter Eades
Automata, Cryptography, and Complexity Theory
Undecidability Results for Monoids with Linear-Time Decidable Word Problems / Masashi Katsura ; Yuji Kobayashi ; Friedrich Otto
Secret Key Exchange Using Random Deals of Cards on Hierarchical Structures / Reina Yoshikawa ; Shimin Guo ; Kazuhiro Motegi ; Yoshihide Igarashi
Derandomizing Arthur-Merlin Games under UniformAssumptions / Chi-Jen Lu
Algorithms and Data Structures (IV)
A Near Optimal Algorithm for Vertex Connectivity Augmentation / Bill Jackson ; Tibor Jordan
Simultaneous Augmentation of Two Graphs to an l-Edge-Connected Graph and a Biconnected Graph / Toshimasa Ishii ; Hiroshi Nagamoch
Location Problems Based on Node-Connectivity and Edge-Connectivity between Nodes and Node-Subsets / Hiro Ito ; Yuichiro Itatsu ; Hideyuki Uehara ; Mitsuo Yokoyama ; otoyasu Ito (Hitachi, Ltd.)
Parallel and Distributed Algorithms
An Intuitive and Effective New Representation for Interconnection Network Structures / Lihua Liu ; Weijia Jia
Randomized Leader Election Protocols in Radio Networks with no Collision Detection / Koji Nakano ; Stephan Olari
Deterministic Broadcasting Time with Partial Knowledge of the Network . / Gianluca De Marco
Algorithms and Data Structures (V)
Minimizing Makespan in Batch Machine Scheduling / Chung K Poon ; Pixing Zhang
Preemptive Parallel Task Scheduling in O(n) + Poly(m) Time / Klaus Jansen ; Lorant Porkolab
Compressed Text Databases with Efficient Query Algorithms Based on the Compressed Suffix Array / Kunihiko Sadakane
Computational Geometry (I)
A Better Lower Bound for Two-Circle Point Labeling / Alexander Wolff ; Michael Thon ; Yinfeng Xu
Voronoi Diagram of a Circle Set Constructed from Voronoi Diagram of a Point Set / Deok-So Kim ; Donguk Kim ; Kokichi Sugihara
An Improved Algorithm for Subdivision Traversal without Extra Storage
Algorithms and Data Structures (VI)
Generalized H-Coloring of Graphs / Petter Kristiansen ; Jan A. Telle
Finding a Two-Core of a Tree in Linear Time / Biing-Fing Wang ; Jyh-Jye Lin
Unbalanced and Hierarchical Bipartite Matchings with Applications to Labeled Tree Comparison / Tak-Wah Lam ; Wing-Kin Sung ; Hing-Fung Ting
Computational Geometry (II)
Optimal Beam Penetrations in Two and Three Dimensions / Danny Z. Chen ; Xiaobo S. Hu ; Jinhui Xu
Searching a Simple Polygon by a k-Searcher / Xuehou Tan
Characterization of Rooms Searchable by Two Guards / Sang-Min Park ; Kyung-Yong Chwa ; Jae-Ha Lee
Computational Biology
Improved Phylogeny Comparisons: Non-shared Edges, Nearest Neighbor Interchanges, and Subtree Transfers Wing-Kai Hon
Phylogenetic k-Root and Steiner k-Root / Guo-Hui Lin ; Tao Jiang ; Paul E. Kearney
Computational Geometry (III)
Maintenance of a Piercing Set for Intervals with Applications / Matthew J. Katz ; Frank Nielsen ; Michael Segal
Optimal Polygon Cover Problems and Applications / Xiaodong Wu
Author Index
Invited Presentations
Voronoi-Based Systems of Coordinates and Surface Reconstruction / Jean-Daniel Boissonnat
Essentially Every Unimodular Matrix Defines an Expander / Jin-Yi Cai
53.

図書

図書
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, c2001  xiv, 937 p. ; 28 cm
所蔵情報: loading…
54.

図書

図書
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
55.

図書

図書
Maxime Crochemore, Mike Paterson (eds.)
出版情報: Berlin ; Tokyo : Springer, c1999  viii, 293 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1645
所蔵情報: loading…
56.

図書

図書
Frank Dehne ... [et al.], (eds.)
出版情報: Berlin ; Tokyo : Springer, c1999  ix, 368 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1663
所蔵情報: loading…
57.

図書

図書
Mike Paterson (ed.)
出版情報: Berlin : Springer, c2000  ix, 450 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1879
所蔵情報: loading…
58.

図書

図書
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
59.

図書

図書
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
60.

図書

図書
Ming Li, Akira Maruoka (eds.)
出版情報: Berlin : Springer, c1997  xi, 460 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1316 . Lecture notes in artificial intelligence
所蔵情報: loading…
61.

図書

図書
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…
62.

図書

図書
Sanjeev Arora ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  ix, 408 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2764
所蔵情報: loading…
63.

図書

図書
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
64.

図書

図書
Giuseppe Di Battista, Uri Zwick (eds.)
出版情報: Berlin ; Tokyo : Springer, c2003  xiv, 790 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2832
所蔵情報: loading…
65.

図書

図書
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
66.

図書

図書
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…
67.

図書

東工大
目次DB

図書
東工大
目次DB
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
68.

図書

図書
Celso C. Ribeiro, Simone L. Martins (eds.)
出版情報: Berlin ; Tokyo : Springer, c2004  x, 586 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 3059
所蔵情報: loading…
69.

図書

図書
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…
70.

図書

図書
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
71.

図書

図書
Prosenjit Bose, Pat Morin (eds.)
出版情報: Berlin ; Tokyo : Springer, c2002  xiii, 656 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2518
所蔵情報: loading…
72.

図書

図書
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…
73.

図書

図書
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…
74.

図書

図書
Ding-Zhu Du, Xiang-Sun Zhang (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1994  xiii, 688 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 834
所蔵情報: loading…
75.

図書

図書
Frank Dehne, Jörg-Rüdiger Sack, Roberto Tamassia (eds.)
出版情報: Berlin ; Tokyo : Springer, c2001  xii, 484 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2125
所蔵情報: loading…
76.

図書

図書
Michel Goemans ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c2001  ix, 296 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2129
所蔵情報: loading…
77.

図書

図書
Stefan Näher, Dorothea Wagner (eds.)
出版情報: Berlin ; Tokyo : Springer, c2001  viii, 241 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1982
所蔵情報: loading…
目次情報: 続きを見る
Invited Lectures
On the Differences between "Practical" and "Applied" / Karsten Weihe
Contributed Papers
An Experimental Study of Online Scheduling Algorithms / Susanne Albers ; Bianca Schröder
Implementation of O(nmlog n) Weighted Matchings in General Graphs. The Power of Data Structures / Kurt Mehlhorn ; Guido Schäfer
Pushing the Limits in Sequential Sorting / Stefan Edelkamp ; Patrick Stiegeler
Efficient Sorting Using Registers and Caches / Lars Arge ; Jeff Chase ; Jeffrey S. Vitter ; Rajiv Wickremesinghe
Lattice Basis Reduction with Dynamic Approximation / Werner Backes ; Susanne Wetzel
Clustering Data without Prior Knowledge / Javed Aslam ; Alain Leblanc ; Clifford Stein
Recognizing Bundles in Time Table Graphs - A Structural Approach / Annegret Liebers
Analysis and Experimental Evaluation of an Innovative and Efficient Routing Protocol for Ad-hoc Mobile Networks / I. Chatzigiannakis ; S. Nikoletseas ; P. Spirakis
Portable List Ranking: An Experimental Study / Isabelle Guérin Lassous ; Jens Gustedt
Parallelizing Local Search for CNF Satisfiability Using Vectorization and PVM / Kazuo Iwama ; Daisuke Kawai ; Shuichi Miyazaki ; Yasuo Okabe ; Jun Umemoto
Asymptotic Complexity from Experiments? A Case Study for Randomized Algorithms / Peter Sanders ; Rudolf Fleischer
Visualizing Algorithms over the Web with the Publication-Driven Approach / Camil Demetrescu ; Irene Finocchi ; Giuseppe Liotta
Interchanging Two Segments of an Array in a Hierarchical Memory System / Jesper Bojesen ; Jyrki Katajainen
Two-Dimensional Arrangements in CGAL and Adaptive Point Location for Parametric Curves / Iddo Hanniel ; Dan Halperin
Planar Point Location for Large Data Sets: To Seek or Not to Seek / Jan Vahrenhold ; Klaus H. Hinrichs
Implementation of Approximation Algorithms for Weighted and Unweighted Edge-Disjoint Paths in Bidirected Trees / Thomas Erlebach ; Klaus Jansen
Dynamic Maintenance Versus Swapping: An Experimental Study on Shortest Paths Trees / Guido Proietti
Maintaining Shortest Paths in Digraphs with Arbitrary Arc Weights: An Experimental Study / Daniele Frigioni ; Alberto Marchetti-Spaccamela ; Umberto Nanni
New Algorithms for Examination Timetabling / Massimiliano Caramia ; Paolo Dell'Olmo ; Giuseppe F. Italiano
Author Index
Invited Lectures
On the Differences between "Practical" and "Applied" / Karsten Weihe
Contributed Papers
78.

図書

図書
Olivier Gascuel, Bernard M.E. Moret (eds.)
出版情報: Berlin ; Tokyo : Springer, c2001  x, 306 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2149
所蔵情報: loading…
目次情報: 続きを見る
An Improved Model for Statistical Alignment / Istvan Miklós ; Zoltán Toroczkai
Improving Profile-Profile Alignments via Log Average Scoring / Niklas von Öhsen ; Ralf Zimmer
False Positives in Genomic Map Assembly and Sequence Validation / Thomas Anantharaman ; Bud Mishra
Boosting EM for Radiation Hybrid and Genetic Mapping / Thomas Schiex ; Patrick Chabrier ; Martin Bouchez ; Denis Milan
Placing Probes along the Genome Using Pairwise Distance Data / Will Casey ; Mike Wigler
Comparing a Hidden Markov Model and a Stochastic Context-Free Grammar / Arun Jagota ; Rune B. Lyngsø ; Christian N.S. Pedersen
Assessing the Statistical Significance of Overrepresented Oligonucleotides / Alain Denise ; Mireille Régnier ; Mathias Vandenbogaert
Pattern Matching and Pattern Discovery Algorithms for Protein Topologies / Juris Viksna ; David Gilbert
Computing Linking Numbers of a Filtration / Herbert Edelsbrunner ; Afra Zomorodian
Side Chain-Positioning as an Integer Programming Problem / Olivia Eriksson ; Yishao Zhou ; Arne Elofsson
A Chemical-Distance-Based Test for Positive Darwinian Selection / Tal Pupko ; Roded Sharan ; Masami Hasegawa ; Ron Shamir ; Dan Graur
Finding a Maximum Compatible Tree for a Bounded Number of Trees with Bounded Degree Is Solvable in Polynomial Time / Ganeshkumar Ganapathysaravanabavan ; Tandy Warnow
Experiments in Computing Sequences of Reversals / Anne Bergeron ; François Strasbourg
Exact-IEBP: A New Technique for Estimating Evolutionary Distances between Whole Genomes / Li-San Wang
Finding an Optimal Inversion Median: Experimental Results / Adam C. Siepel ; Bernard M.E. Moret
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites / Benny Chor ; Michael Hendy ; David Penny
The Performance of Phylogenetic Methods on Trees of Bounded Diameter / Luay Nakhleh ; Usman Roshan ; Katherine St. John ; Jerry Sun
(1=?)-Approximation of Sorting by Reversals and Transpositions / Niklas Eriksen
On the Practical Solution of the Reversal Median Problem / Alberto Caprara
Algorithms for Finding Gene Clusters / Steffen Heber ; Jens Stoye
Determination of Binding Amino Acids Based on Random Peptide Array Screening Data / Peter J. van der Veen ; L.F.A. Wessels ; J.W. Slootstra ; R.H. Meloen ; M.J.T. Reinders ; J. Hellendoorn
A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites / Yoseph Barash ; Gill Bejerano ; Nir Friedman
Comparing Assemblies Using Fragments and Mate-Pairs / Daniel H. Huson ; Aaron L. Halpern ; Zhongwu Lai ; Eugene W. Myers ; Knut Reinert ; Granger G. Sutton
Author Index
An Improved Model for Statistical Alignment / Istvan Miklós ; Zoltán Toroczkai
Improving Profile-Profile Alignments via Log Average Scoring / Niklas von Öhsen ; Ralf Zimmer
False Positives in Genomic Map Assembly and Sequence Validation / Thomas Anantharaman ; Bud Mishra
79.

図書

図書
Gerth Stølting Brodal, Daniele Frigioni, Alberto Marchetti-Spaccamela (eds.)
出版情報: Berlin ; Tokyo : Springer, c2001  x, 197 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 2141
所蔵情報: loading…
目次情報: 続きを見る
Compact DFA Representation for Fast Regular Expression Search / Gonzalo Navarro ; Mathieu Raffinot
The Max-Shift Algorithm for Approximate String Matching / Costas S. Iliopoulos ; Laurent Mouchard ; Yoan J. Pinzon
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance / Gianfranco Bilardi ; Paolo D'Alberto ; Alex Nicolau
Experiences with the Design and Implementation of Space-Efficient Deques / Jyrki Katajainen ; Bjarke Buur Mortensen
Designing and Implementing a General Purpose Halfedge Data Structure / Hervé Brönnimann
Optimised Predecessor Data Structures for Internal Memory / Naila Rahman ; Richard Cole ; RajeevRaman
An Adaptable and Extensible Geometry Kernel / Susan Hert ; Michael Hoffmann ; Lutz Kettner ; Sylvain Pion ; Michael Seel
Efficient Resource Allocation with Noisy Functions / Arne Andersson ; Per Carlsson ; Fredrik Ygge
Improving the Efficiency of Branch and Bound Algorithms for the Simple Plant Location Problem / Boris Goldengorin ; Diptesh Ghosh ; Gerard Sierksma
Exploiting Partial Knowledge of Satisfying Assignments / Kazuo Iwama ; Suguru Tamaki
Using PRAM Algorithms on a Uniform-Memory-Access Shared-Memory Architecture / David A. Bader ; Ajith K. Illendula ; Bernard M.E. Moret ; Nina R. Weisse-Bernstein
An Experimental Study of Data Migration Algorithms / Eric Anderson ; Joe Hall ; Jason Hartline ; Michael Hobbs ; Anna R. Karlin ; Jared Saia ; Ram Swaminathan ; John Wilkes
An Experimental Study of Basic Communication Protocols in Ad-hoc Mobile Networks / Ioannis Chatzigiannakis ; Sotiris Nikoletseas ; Nearchos Paspallis ; Paul Spirakis ; Christos Zaroliagis
Experimental Analysis of Algorithms for Bilateral-Contract Clearing Mechanisms Arising in Deregulated Power Industry / Chris Barrett ; Doug Cook ; Gregory Hicks ; Vance Faber ; Achla Marathe ; Madhav Marathe ; Aravind Srinivasan ; Yoram J. Sussmann and
Heidi Thornquist Pareto Shortest Paths is Often Feasible in Practice / Matthias Muller-Hannemann ; Karsten Weihe
Author Index
Compact DFA Representation for Fast Regular Expression Search / Gonzalo Navarro ; Mathieu Raffinot
The Max-Shift Algorithm for Approximate String Matching / Costas S. Iliopoulos ; Laurent Mouchard ; Yoan J. Pinzon
Fractal Matrix Multiplication: A Case Study on Portability of Cache Performance / Gianfranco Bilardi ; Paolo D'Alberto ; Alex Nicolau
80.

図書

図書
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…
81.

図書

図書
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…
82.

図書

図書
Alberto Apostolico, Jotun Hein (eds.)
出版情報: Berlin ; New York ; Tokyo : Springer-Verlag, c1997  viii, 274 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1264
所蔵情報: loading…
83.

図書

図書
Frank Dehne ... [et al.], (eds.)
出版情報: Berlin : Springer, c1997  x, 476 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1272
所蔵情報: loading…
84.

図書

図書
Rainer Burkard, Gerhard Woeginger (eds.)
出版情報: Berlin ; Tokyo : Springer, c1997  xi, 513 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1284
所蔵情報: loading…
85.

図書

図書
Marios Mavronicolas, Philippas Tsigas (eds.)
出版情報: Berlin ; New York : Springer, c1997  x, 332 p.
シリーズ名: Lecture notes in computer science ; 1320
所蔵情報: loading…
86.

図書

図書
Tetsuo Asano ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  x, 448 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1178
所蔵情報: loading…
87.

図書

図書
Josep Diaz, Maria Serna (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  xii, 566 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1136
所蔵情報: loading…
88.

図書

図書
editors, Efthimios Kaxiras ... [et al.]
出版情報: Pittsburgh, Pennsylvania : Materials Research Society, 1996  xiv, 611 p. ; 24 cm
シリーズ名: Materials Research Society symposium proceedings ; v. 408
所蔵情報: loading…
89.

図書

図書
Özalp Babaoğlu, Keith Marzullo (eds.)
出版情報: Berlin : Springer, c1996  viii, 379 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1151
所蔵情報: loading…
90.

図書

図書
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…
91.

図書

図書
Selim G. Akl ... [et al.], (eds.)
出版情報: Berlin : Springer, c1995  ix, 517 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 955
所蔵情報: loading…
92.

図書

図書
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…
93.

図書

図書
Afonso Ferreira, José Rolim (eds.)
出版情報: Berlin ; Tokyo : Springer-Verlag, c1995  x, 409 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 980
所蔵情報: loading…
94.

図書

図書
Paul Spirakis (ed.)
出版情報: Berlin ; Tokyo : Springer, c1995  xii, 598 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 979
所蔵情報: loading…
95.

図書

図書
Klaus P. Jantke, Takeshi Shinohara, Thomas Zeugmann, (eds.)
出版情報: Berlin ; Tokyo : Springer, c1995  xv, 318 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 997 . Lecture notes in artificial intelligence
所蔵情報: loading…
96.

図書

図書
John Staples ... [et al.] (eds.)
出版情報: Berlin ; Tokyo : Springer, c1995  xv, 440 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1004
所蔵情報: loading…
97.

図書

図書
Kanchana Kanchanasut, Jean-Jacques Lévy (eds.)
出版情報: Berlin ; Tokyo : Springer, c1995  x, 410 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1023
所蔵情報: loading…
98.

図書

図書
Dan Hirschberg, Gene Myers, (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  viii, 391 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1075
所蔵情報: loading…
99.

図書

図書
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…
100.

図書

図書
A. Ferreira ... [et al.], (eds.)
出版情報: Berlin ; Tokyo : Springer, c1996  ix, 358 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1117
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼