close
1.

図書

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

図書

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

図書

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

図書

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

図書

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

図書

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

図書

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

図書

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

図書

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

図書

図書
Martin Farach-Colton (ed.)
出版情報: Berlin : Springer, c1998  viii, 250 p. ; 24 cm
シリーズ名: Lecture notes in computer science ; 1448
所蔵情報: loading…
文献の複写および貸借の依頼を行う
 文献複写・貸借依頼