close
1.

電子ブック

EB
edited by Andrew Phillips, Peng Yin
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9211
オンライン: http://dx.doi.org/10.1007/978-3-319-21999-8
目次情報: 続きを見る
Algorithms and models for computation on biomolecular Systems
Computational processes in vitro and in vivo
Molecular switches, gates, devices, and circuits
Molecular folding and self-assembly of nanostructures
Analysis and theoretical models of laboratory techniques
Molecular motors and molecular robotics
Studies of fault-tolerance and error correction
Software tools for analysis, simulation, and design
Synthetic biology and in vitro Evolution
Applications in engineering, physics, chemistry, biology, and medicine
Algorithms and models for computation on biomolecular Systems
Computational processes in vitro and in vivo
Molecular switches, gates, devices, and circuits
2.

電子ブック

EB
edited by Giuseppe Amato, Richard Connor, Fabrizio Falchi, Claudio Gennaro
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9371
オンライン: http://dx.doi.org/10.1007/978-3-319-25087-8
3.

電子ブック

EB
edited by Laura Sanita, Martin Skutella
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9499
オンライン: http://dx.doi.org/10.1007/978-3-319-28684-6
目次情報: 続きを見る
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
Competitive analysis
Computational advertising
Computational finance
Cuts and connectivity
Geometric problems
Graph algorithms
Inapproximability
Mechanism design
Natural algorithms
Network design
Packing and covering.-Paradigms for the design and analysis of approximation and online algorithms.-Parameterized complexity. Scheduling problems. -Real-world applications
Algorithmic game theory
Algorithmic trading
Coloring and partitioning
4.

電子ブック

EB
edited by Giuseppe F Italiano, Giovanni Pighizzini, Donald T. Sannella
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9234
オンライン: http://dx.doi.org/10.1007/978-3-662-48057-1
5.

電子ブック

EB
edited by Khaled Elbassioni, Kazuhisa Makino
出版情報: Berlin, Heidelberg : Springer Berlin Heidelberg : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9472
オンライン: http://dx.doi.org/10.1007/978-3-662-48971-0
6.

電子ブック

EB
edited by Teijiro Isokawa, Katsunobu Imai, Nobuyuki Matsui, Ferdinand Peper, Hiroshi Umeo
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 8996
オンライン: http://dx.doi.org/10.1007/978-3-319-18812-6
目次情報: 続きを見る
Complexity of One-Way Cellular Automata
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal
A Universal Cellular Automaton Without Sensitive Subsystems
Real-Time Reversible One-Way Cellular Automata
Cycle Equivalence of Finite Dynamical Systems Containing Symmetries
Generalized FSSP on Hexagonal Tiling: Towards Arbitrary Regular Spaces
Strict Majority Bootstrap Percolation on Augmented Tori and Random Regular Graphs: Experimental Results
Rapaport Language Recognition by Reversible Partitioned Cellular Automata
Complexity of Conjugacy, Factoring and Embedding for Countable Sofic Shifts of Rank 2
Plane-Walking Automata
Complexity of One-Way Cellular Automata
Computational Complexity of the Avalanche Problem on One Dimensional Kadanoff Sandpiles
5-State Rotation-Symmetric Number-Conserving Cellular Automata are not Strongly Universal
7.

電子ブック

EB
edited by Ferdinando Cicalese, Ely Porat, Ugo Vaccaro
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9133
オンライン: http://dx.doi.org/10.1007/978-3-319-19929-0
目次情報: 続きを見る
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
A Framework for Space-Efficient String Kernels
Composite Repetition-Aware Data Structures
Efficient Construction of a Compressed de Bruijn Graph for Pan-Genome Analysis
Longest Common Extensions in Trees
Longest Common Extensions in Sublinear Space
Ranked Document Retrieval with Forbidden Pattern
Parameterized Complexity of Superstring Problems
On the Fixed Parameter Tractability and Approximability of the Minimum Error Correction Problem
Fast String Dictionary Lookup with One Error
On the Readability of Overlap Digraphs
Improved Algorithms for the Boxed-Mesh Permutation Pattern Matching Problem
Range Minimum Query Indexes in Higher Dimensions
Alphabet-Dependent String Searching with Wexponential Search Trees
Lempel Ziv Computation in Small Space (LZ-CISS)
Succinct Non-overlapping Indexing
Encodings of Range Maximum-Sum Segment Queries and Applications
Compact Indexes for Flexible Top-k Retrieval
LZD Factorization: Simple and Practical Online Grammar Compression with Variable-to-Fixed Encoding
Combinatorial RNA Design: Designability and Structure-Approximating Algorithm
Dictionary Matching with Uneven Gaps
Partition into Heapable Sequences, Heap Tableaux and a Multiset Extension of Hammersley’s Process
The Approximability of Maximum Rooted Triplets Consistency with Fan Triplets and Forbidden Triplets
String Powers in Trees
Online Detection of Repetitions with Backtracking
Greedy Conjecture for Strings of Length 4
Tighter Bounds for the Sum of Irreducible LCP Values
Parallel External Memory Suffix Sorting
On Maximal Unbordered Factors
Semi-dynamic Compact Index for Short Patterns and Succinct van Emde Boas Tree
Reporting Consecutive Substring Occurrences Under Bounded Gap Constraints
A Probabilistic Analysis of the Reduction Ratio in the Suffix-Array IS Algorithm
Encoding Nearest Larger Values
Sorting by Cuts, Joins and Whole Chromosome Duplications
On the Hardness of Optimal Vertex Relabeling and Restricted Vertex Relabeling
A Framework for Space-Efficient String Kernels
Composite Repetition-Aware Data Structures
8.

電子ブック

EB
edited by Francesco Parisi-Presicce, Bernhard Westfechtel
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9151
オンライン: http://dx.doi.org/10.1007/978-3-319-21145-9
目次情報: 続きを見る
Polymorphic Sesqui-Pushout Graph Rewriting
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
AGREE ? Algebraic Graph Rewriting with Controlled Embedding
Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings
Towards Local Confluence Analysis for Amalgamated Graph Transformation
Multi-amalgamated Triple Graph Grammars
Reconfigurable Petri Nets with Transition Priorities and Inhibitor Arcs
Reachability in Graph Transformation Systems and Slice Languages
Equational Reasoning with Context-Free Families of String Diagrams
Translating Essential OCL Invariants to Nested Graph Constraints Focusing on Set Operations
Characterizing Conflicts Between Rule Application and Rule Evolution in Graph Transformation Systems
Graph Pattern Matching as an Embedded Clojure DSL
Using Graph Transformations for Formalizing Prescriptions and Monitoring
Towards Compliance Verification Between Global and Local Process Models
Inductive Invariant Checking with Partial Negative Application Conditions
Tool Support for Multi-amalgamated Triple Graph Grammars
Uncover: Using Coverability Analysis for Verifying Graph Transformation Systems
Local Search-Based Pattern Matching Features in EMF-INCQUERY
Polymorphic Sesqui-Pushout Graph Rewriting
Predictive Top-Down Parsing for Hyperedge Replacement Grammars
AGREE ? Algebraic Graph Rewriting with Controlled Embedding
9.

電子ブック

EB
by Kent D. Lee, Steve Hubbard
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Undergraduate Topics in Computer Science ;
オンライン: http://dx.doi.org/10.1007/978-3-319-13072-9
目次情報: 続きを見る
1: Python Programming 101
2: Computational Complexity
3: Recursion
Sequences
4: Sets and Maps
5: Trees
6: Graphs
7: Membership Structures
8: Heaps
9: Balanced Binary Search Trees
10: B-Trees
11: Heuristic Search
Appendix A: Integer Operators
Appendix B: Float Operators
Appendix C: String Operators and Methods
Appendix D: List Operators and Methods
Appendix E: Dictionary Operators and Methods
Appendix F: Turtle Methods
Appendix G: TurtleScreen Methods
Appendix H: Complete Programs
1: Python Programming 101
2: Computational Complexity
3: Recursion
10.

電子ブック

EB
edited by Cheng-Lin Liu, Bin Luo, Walter G. Kropatsch, Jian Cheng
出版情報: Cham : Springer International Publishing : Imprint: Springer, 2015
シリーズ名: Lecture Notes in Computer Science ; 9069
オンライン: http://dx.doi.org/10.1007/978-3-319-18224-7
目次情報: 続きを見る
Graph-based Representation
Approximation of Graph Edit Distance in Quadratic Time
Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem
An Entropic Edge Assortativity Measure
A Subpath Kernel for Learning Hierarchical Image Representations
Coupled-Feature Hypergraph Representation for Feature Selection
Reeb Graphs Through Local Binary Patterns
Incremental embedding within a dissimilarity-based framework
Graph Matching
A First Step Towards Exact Graph Edit Distance Using Bipartite Graph Matching
Consensus of Two Graph Correspondences through a Generalisation of the Bipartite Graph Matching Algorithm
Revisiting Volegnant-Jonker for Approximating Graph Edit Distance
A Hypergraph Matching Framework for Refining Multi-source Feature Correspondences
Kite Recognition by means of Graph Matching
GEM++: a tool for solving substitution-tolerant subgraph isomorphism
A Graph Database Repository and Performance Evaluation Metrics for Graph Edit Distance
Improving Hausdorff Edit Distance Using Structural Node Context
Learning Graph Model for Different Dimensions Image Matching
VF2 Plus: An Improved Version of VF2 For Biological Graphs
Report on the First Contest on Graph Matching Algorithms for Pattern Search in Biological Databases
Approximate Graph Edit Distance Computation Combining Bipartite Matching and Exact Neighborhood Substructure Distance
Multi-layer Tree Matching Using HSTs
Large-scale Graph Indexing using Binary Embeddings of Node Contexts
Attributed Relational Graph Matching with Sparse Relaxation and Bistochastic Normalization
Graph Clustering and Classification.-On the Influence of Node Centralities on Graph Edit Distance for Graph Classification
A Mixed Weisfeiler-Lehman Graph Kernel
A Quantum Jensen-Shannon Graph Kernel using Discrete-time Quantum Walks
Density Based Cluster Extension and Dominant Sets Clustering
Salient Object Segmentation from Stereoscopic Images
Causal Video Segmentation using Superseeds and Graph Matching
Fast Minimum Spanning Tree based Clustering Algorithms on Local Neighborhood Graph
Graph-based Application
From bags to graphs of stereo subgraphs in order to predict molecule's properties
Thermodynamics of Time Evolving Networks
Isometric Mapping Hashing
Skeletal Graphs from Schrodinger Magnitude and Phase
Graph Based Lymphatic Vessel Wall Localisation and Tracking
A Comic Retrieval System Based on Multilayer Graph Representation and Graph Mining
Learning High-Order Structures for Texture Retrieval
Graph-based Representation
Approximation of Graph Edit Distance in Quadratic Time
Data Graph Formulation as the Minimum-Weight Maximum-Entropy Problem